𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Injective coloring of plane graphs with girth 5

✍ Scribed by Dong, Wei; Lin, Wensong


Book ID
122127738
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
401 KB
Volume
315-316
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


b-Coloring graphs with large girth
✍ Victor Campos, Victor A. E. de Farias… πŸ“‚ Article πŸ“… 2012 πŸ› SciELO 🌐 English βš– 259 KB
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.