𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On linear coloring of planar graphs with small girth

✍ Scribed by Dong, Wei; Lin, Wensong

Book ID
122121534
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
461 KB
Volume
173
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

(2 + ?)-Coloring of planar graphs with l
(2 + ?)-Coloring of planar graphs with large odd-girth
✍ Klostermeyer, William; Zhang, Cun Quan πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 258 KB πŸ‘ 3 views

The odd-girth of a graph is the length of a shortest odd circuit. A conjecture by Pavol Hell about circular coloring is solved in this article by showing that there is a function f ( ) for each : 0 < < 1 such that, if the odd-girth of a planar graph G is at least f ( ), then G is (2 + )-colorable. N

3-List-Coloring Planar Graphs of Girth 5
3-List-Coloring Planar Graphs of Girth 5
✍ C. Thomassen πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 269 KB

We prove that every planar graph of girth at least 5 is 3-choosable. It is even possible to precolor any 5-cycle in the graph. This extension implies GrΓΆtzsch's theorem that every planar graph of girth at least 4 is 3-colorable. If 1995 Academic Press, Inc.