On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs

I. Fáry, On straight line representation of planar graphs, Acta Sci. Math. (Szeged), 11 (1948), 229–233.
MathSciNet MATH Google Scholar
B. Grünbaum, Convex polytopes, Wiley, New York, 1967.
MATH Google Scholar
B. Grünbaum, Higher-dimensional analogues of the four-color problem and some inequalities for simplicial complexes, J. Combinatorial Theory, to appear.
Google Scholar
F. Harary, Graph theory, Addison-Wesley, Reading, 1969.
MATH Google Scholar
E.L. Johnson, A proof of 4-coloring the edges of a cubic graph, Amer. Math. Monthly, 73 (1966), 52–55.
Article MathSciNet MATH Google Scholar
H.A. Jung, Zusammenzüge und Unterteilungen von Graphen, Math. Nachr., 35 (1967), 241–267.
Article MathSciNet MATH Google Scholar
T.P. Kirkman, On autopolar polyhedra, Philos. Trans. Roy. Soc. London, 147 (1857), 183–215.
Article Google Scholar
V. Klee, Convex polytopes and linear programming, Proc. IBM Scientific Computing Symposium on Combinatorial Problems, March 16–18, 1964, pp. 123–158 (1966).
Google Scholar
A. Kotzig, O istých rozkladoch grafu. Mat.-fyz. casop. Sloven. Akad. Vied, Bratislava, 5 (1955), 144–151.
MathSciNet Google Scholar
D.G. Larman and P. Mani, On the existence of certain configurations within graphs and the 1-skeletons of polytopes, to appear.
Google Scholar
L.A. Lyusternik, Convex figures and polyhedra (in Russian), Moscow, 1956. (English translations: Heath and Co., Boston 1966, and Dover, New York 1963).
Google Scholar
W. Mader, Homomorphieeigenschaften und mittlere Kantendichte von Graphen, Math. Ann., 174 (1967), 265–268.
Article MathSciNet MATH Google Scholar
O. Ore, The four color problem, Academic Press, New York 1967.
MATH Google Scholar
E. Steinitz, Polyeder und Raumeinteilungen, Enzykl. Math. Wiss., Vol. 3 (Geometrie), Part 3 AB 12, pp. 1–139 (1922).
Google Scholar
E. Steinitz and H. Rademacher, Vorlesungen über die Theorie der Polyeder, Springer, Berlin 1934.
MATH Google Scholar
M. Stojaković, Über die Konstruktion der ebenen Graphen, Univ. Beograd. Godisnjak Filozof. Fak. Novom Sadu, 4 (1959), 375–378.
MathSciNet MATH Google Scholar
W.T. Tutte, A theory of 3-connected graphs, Indag. Math., 23 (1961), 441–455.
Article MathSciNet MATH Google Scholar
K. Wagner, Bemerkungen zem Vierfarbenproblem. Jber. Deutsch. Math. Vereim., 46 (1936), 26–32.
MATH Google Scholar

Download references

Author information

Authors and Affiliations

University of California at Davis Branko Grünbaum, University of Washington, USA
David W. Barnette

Authors

David W. Barnette
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

G. Chartrand S. F. Kapoor

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Barnette, D.W. (1969). On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs. In: Chartrand, G., Kapoor, S.F. (eds) The Many Facets of Graph Theory. Lecture Notes in Mathematics, vol 110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0060102

Download citation

DOI: https://doi.org/10.1007/BFb0060102
Published: 22 August 2006
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-04629-5
Online ISBN: 978-3-540-36161-9
eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs

Access this chapter

Preview

References