On Steinitz's theorem concerning convex 3-polytopes and on some properties of planar graphs
作者： David W. Barnette
DOI: 10.1007/BFB0060102
关键词:
摘要: Abstract : Two relatively simple proofs for the famous theorem of Steinitz on characterization graphs 3-polytopes are presented, together with some new results structure 3-connected graphs. (Author)
springer.com
springerlink.com参考文章(12)
Oystein Ore, The four-color problem ,(1967)
Hans Rademacher, Ernst Steinitz, Vorlesungen über die Theorie der Polyeder unter Einfluss der Elemente der Topologie Springer. ,(1934)
W. Mader, Homomorphieeigenschaften und mittlere Kantendichte von Graphen Mathematische Annalen. ,vol. 174, pp. 265- 268 ,(1967) , 10.1007/BF01364272
W.T. Tutte, A theory of 3-connected graphs Indagationes Mathematicae (Proceedings). ,vol. 64, pp. 441- 455 ,(1961) , 10.1016/S1385-7258(61)50045-5
Branko Grünbaum, Higher-Dimensional analogs of the four-color problem and some inequalities for simplicial complexes Journal of Combinatorial Theory. ,vol. 8, pp. 147- 153 ,(1970) , 10.1016/S0021-9800(70)80071-0
H. A. Jung, Zusammenzüge und Unterteilungen von Graphen Mathematische Nachrichten. ,vol. 35, pp. 241- 267 ,(1967) , 10.1002/MANA.19670350503
D. G. Larman, P. Mani, On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes Proceedings of the London Mathematical Society. ,vol. s3-20, pp. 144- 160 ,(1970) , 10.1112/PLMS/S3-20.1.144
On Autopolar Polyedra Philosophical Transactions of the Royal Society. ,vol. 147, pp. 183- 215 ,(1857) , 10.1098/RSTL.1857.0012
Victor Klee, CONVEX POLYTOPES AND LINEAR PROGRAMMING. ,(1964)
E. L. Johnson, A Proof of 4-Coloring the Edges of a Cubic Graph American Mathematical Monthly. ,vol. 73, pp. 52- ,(1966) , 10.2307/2313923