3-list-coloring planar graphs of girth 5
From MaRDI portal
Publication:1892853
DOI10.1006/jctb.1995.1027zbMath0822.05029MaRDI QIDQ1892853
Publication date: 4 July 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1027
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Amenable colorings, The complexity of planar graph choosability, The list chromatic numbers of some planar graphs, The 4-choosability of plane graphs without 4-cycles, A not 3-choosable planar graph without 3-cycles