Every planar graph is 5-choosable
From MaRDI portal
Publication:1333334
DOI10.1006/jctb.1994.1062zbMath0805.05023WikidataQ56390727 ScholiaQ56390727MaRDI QIDQ1333334
Publication date: 26 January 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.1994.1062
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Acyclic list 7‐coloring of planar graphs, Unnamed Item, Unnamed Item, Amenable colorings, Planar graphs without cycles of specific lengths, The complexity of planar graph choosability, List homomorphisms to reflexive graphs, You can't paint yourself into a corner, The list chromatic numbers of some planar graphs, The 4-choosability of plane graphs without 4-cycles, Algorithmic complexity of list colorings, Color-critical graphs on a fixed surface, The chromatic number of a graph of girth 5 on a fixed surface, A short list color proof of Grötzsch's theorem, On 3-choosability of plane graphs without 6-, 7- and 9-cycles, Extending graph colorings, Choosability of \(K_5\)-minor-free graphs, The 3-choosability of plane graphs of girth 4, Choosability, edge choosability and total choosability of outerplane graphs, On structure of some plane graphs with application to choosability, Decomposing a planar graph into an independent set and a 3-degenerate graph, Coloring face-hypergraphs of graphs on surfaces, The edge-face choosability of plane graphs, A not 3-choosable planar graph without 3-cycles
