𝔖 Bobbio Scriptorium
✦   LIBER   ✦

List injective coloring of planar graphs with girth 5, 6, 8

✍ Scribed by Bu, Yuehua; Lu, Kai


Book ID
122504724
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
519 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


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.