Few theorems are known about planar graphs.
For, example, Kuratowski proved that a graph is planar if and only if it has no subgraph homeomorphic to Kâ
or Kâ,â. It has remained as a direct criterion for determining whether a graph is planar or not. Powerful as the theorem is, it is not always easy to apply. This leads us to try some practical methods to test a planar graph.
In this thesis, we have an algorithm for finding an outer circuit for a simple connected planar graph. Then, we use this outer circuit to draw a straight line graph in the plane. The programme for this algorithm is written in FORTRAN for an IBM 360/67 Computer. / Science, Faculty of / Computer Science, Department of / Graduate
| Identifer | oai:union.ndltd.org:UBC/oai:circle.library.ubc.ca:2429/34212 |
| Date | January 1971 |
| Creators | Shiau, Luang-hung |
| Publisher | University of British Columbia |
| Source Sets | University of British Columbia |
| Language | English |
| Detected Language | English |
| Type | Text, Thesis/Dissertation |
| Rights | For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
Page generated in 0.0325 seconds