K6-Minors in Projective Planar Graphs
✍ Scribed by Gašper Fijavž*; Bojan Mohar*
- Book ID
- 106167473
- Publisher
- Springer-Verlag
- Year
- 2003
- Tongue
- English
- Weight
- 296 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0209-9683
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract An exact structure is described to classify the projective‐planar graphs that do not contain a __K__~3, 4~‐minor. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory
## Abstract It is shown that every sufficiently large almost‐5‐connected non‐planar graph contains a minor isomorphic to an arbitrarily large graph from one of six families of graphs. The graphs in these families are also almost‐5‐connected, by which we mean that they are 4‐connected and all 4‐sepa
## Abstract In this paper, we shall prove that a projective‐planar (resp., toroidal) triangulation __G__ has __K__~6~ as a minor if and only if __G__ has no quadrangulation isomorphic to __K__~4~ (resp., __K__~5~ ) as a subgraph. As an application of the theorems, we can prove that Hadwiger's conje
## Abstract Let __G__ be a connected graph which is projective‐planar but is not planar. It will be shown that __G__ can be embedded in the projective plane so that it has only even faces if and only if either __G__ is bipartite or its canonical bipartite covering is planar and that such an embeddi