Some structural properties of planar graphs and their applications to 3-choosability
✍ Scribed by Min Chen; Mickaël Montassier; André Raspaud
- Book ID
- 113567463
- Publisher
- Elsevier Science
- Year
- 2012
- Tongue
- English
- Weight
- 461 KB
- Volume
- 312
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A graph G=(V, E) is (x, y)-choosable for integers x> y 1 if for any given family In this paper, structures of some plane graphs, including plane graphs with minimum degree 4, are studied. Using these results, we may show that if G is free of k-cycles for some k # [3,4,5,6], or if any two triangles
If in a plane graph with minimum degree 2 3 no t w o triangles have an edge in common, then: (1 there are two adjacent vertices with degree sum at most 9, and (2) there is a face of size between 4 and 9 or a 10-face incident with ten 3-vertices. It follows that every planar graph without cycles betw