Unprovability threshold for the planar graph minor theorem
β Scribed by Andrey Bovykin
- Publisher
- Elsevier Science
- Year
- 2010
- Tongue
- English
- Weight
- 226 KB
- Volume
- 162
- Category
- Article
- ISSN
- 0168-0072
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
planar graph that contains every planar graph as a minor.
In this article it is shown that every 4-connected graph that does not contain a minor isomorphic to the octahedron is isomorphic to the square of an odd cycle.
## Abstract Let __G__ be the unique 4βconnected simple graph obtained by adding an edge to the Octahedron. Every 4βconnected graph that does not contain a minor isomorphic to __G__ is either planar or the square of an odd cycle. Β© 2007 Wiley Periodicals, Inc. J Graph Theory 57: 124β130, 2008
In a recent paper, Carsten Thomassen [Carsten Thomassen, Planarity and duality of finite and infinite graphs. J. Combinatorial Theory Ser. B 29 (1980) 244-2711 has shown that a number of criteria for the planarity of a graph can be reduced to that of Kuratowski. Here we present another criterion whi