Abstract
In practice, there often arises the problem of drawing in the plane graphs which exist, say, in the form of electric networks or time schedules, without any crossing. Such an embedding without crossing is important for the design of printed circuits. If all of the components of an electric network are left unconsidered, the graph G of the network remains and the embedding of this yields a solution to the problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Auslander, L., and S. V. Parter: On imbedding graphs in the sphere, J. Math. Mech. 10 (1961), 517–523.
Bader, W.: Das topologische Problem der gedruckten Schaltung und seine Lösung. Arch. Elektrotechnik 49 (1964), 2–12.
Berge, C., und A. Ghouila-Houri: Programme, Spiele, Transportnetze, 2nd edn., Leipzig 1969. (Translated from French).
Dambitis, J. J.: Methode zur Konstruktion ebener Graphen (Russian), Latv. matem. ežegodnik 6 (1969), 41–63.
Demoucron, G., Y. Malgrange et R. Pertuiset: Graphes planaires: Reconnaissance et construction de représentations planaires topologiques, Rev. Franç. Recherche Operat. 8, Nr. 30 (1964), 33–47
Fischer, G. J., and O. Wing: An algorithm for testing planar graphs from the incidence matrix, in: Proc. 7th Midwest Symp. on Circuit Theory, Ann Arbor, Mich., May 1964.
Fischer, G. J., and Wing, O: On correspondence between a class of planar graphs and bipartite graphs, IEEE Trans. Circuit Theory CT-12 (1965), 266–267.
Guillemin, E. A.: How to grow your trees from given cut-set or tie-set matrices, IRE Trans. Circuit Theory CT-6, Spec. Suppl. (1959), 110–126.
Halin, E.: Bemerkungen über ebene Graphen, Math. Ann. 153 (1964), 38–46.
Halin, R.: Über simpliziale Zerfällung n beliebiger (endlicher oder unendlicher) Graphen, Math. Ann. 156 (1964), 216–225.
Harary, F., and W. T. Tutte: A dual form of Kuratowski’s theorem, Canad. Math. Bull. 8 (1965), 17–20.
Hotz, G.: Einbettung von Streckenkomplexen in die Ebene, Math. Ann. 167 (1966), 214–223.
Jung, H.A.: Eine Verallgemeinerung des n-fachen Zusammenhanges für Graphen, Math. Ann. 187 (1970), 95–103.
Kuratowski, C.: Sur 1e problème des courves gauches en Topologie, Fund. Math. 15 (1930), 271–283.
Lempel, A., S. Even and I. Cederbaum: An algorithm for planarity testing of graphs, in: Théorie des Graphes, Paris/New York 1967, p. 215–232.
Lin, P. M.: On methods of detecting planar graphs, in: Proc. 8th Midwest Symp. on Circuit Theory, Colorado State Univ., June 1965, p. 14-15.
MacLane, S.: A structural characterisation of planar combinatorial graphs, Duke Math. J. 3 (1937), 340–472.
MacLane, S.: A combinatorial condition for planar graphs, Fund. Math. 28 (1937), 22–32.
Mayeda, W.: Necessary and sufficient conditions for realizability of cut-set matrices. IRE Trans. CT-7 (1969), 79–81.
Sachs, H.: Einführung in die Theorie der endlichen Graphen, Teil I, Leipzig 1970.
Sachs, H.: Einführung in die Theorie der endlichen Graphen, Teil II, Leipzig 1972.
Tutte, W. T.: How to draw a graph, Proc. London Math. Soc. 13 (1963), 743–767.
Tutte, W. T.: A theorem on planar graphs, Trans. Amer. Math. Soc. 82 (1956), 99–116.
Tutte, W. T.: Separation of vertices by a circuit, Department of Combinatorics and Optimization, Research Report CORR 74-18, University of Waterloo, Ontario, 1974.
Wagner, K.: Über eine Eigenschaft der ebenen Komplexe, Math. Ann. 114 (1937), 570–590.
Wagner, K.: Eine Klasse minimaler nichtplättbarer Graphen, Math. Ann. 187 (1970), 104–113.
Whitney, H.: Non-separable and planar graphs, Trans. Amer. Math. Soc. 34 (1932), 339–362.
Whitney, H.: Planar graphs, Fund. Math. 21 (1933), 73–84.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1984 VEB Deutscher Verlag der Wissenschaften, Berlin
About this chapter
Cite this chapter
Walther, H. (1984). Embedding of planar graphs in the plane. In: Ten Applications of Graph Theory. Mathematics and Its Applications, vol 7. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7154-7_11
Download citation
DOI: https://doi.org/10.1007/978-94-009-7154-7_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-009-7156-1
Online ISBN: 978-94-009-7154-7
eBook Packages: Springer Book Archive