Every planar graph is 5-choosable

DOI10.1006/JCTB.1994.1062zbMATH Open0805.05023DBLPjournals/jct/Thomassen94aOpenAlexW2089023036WikidataQ56390727 ScholiaQ56390727MaRDI QIDQ1333334FDOQ1333334

Authors: Carsten Thomassen 

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

Recommendations

• List colourings of planar graphs. (Reprint)
• Choosability of planar graphs
• List colourings of planar graphs

zbMATH Keywords

list coloringchoosabilityplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (only showing first 100 items - show all)

• The polynomial method for list-colouring extendability of outerplanar graphs
• Planar graphs without cycles of specific lengths
• Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles
• Adapted list coloring of planar graphs
• Improper choosability and property B
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• Five-list-coloring graphs on surfaces. II: A linear bound for critical graphs in a disk.
• On-line list coloring of matroids
• 5-list-coloring planar graphs with distant precolored vertices
• A sufficient condition for planar graphs to be acyclically 5-choosable
• The 4-choosability of plane graphs without 4-cycles
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• Every plane graph is facially-non-repetitively \(C\)-choosable
• Improper coloring of unit disk graphs
• Homomorphism bounds for oriented planar graphs of given minimum girth
• On group choosability of graphs. II
• Exponentially many 5-list-colorings of planar graphs
• Planar graphs without 4-cycles are acyclically 6-choosable
• Locally planar graphs are 5-choosable
• Choosability, edge choosability and total choosability of outerplane graphs
• A note on the acyclic 3-choosability of some planar graphs
• Planar graphs are 1-relaxed, 4-choosable
• From the plane to higher surfaces
• Color-critical graphs on a fixed surface
• Five-coloring graphs on the Klein bottle
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• The list chromatic numbers of some planar graphs
• Acyclic list 7‐coloring of planar graphs
• Five-list-coloring graphs on surfaces. III: One list of size one and one list of size two
• Acyclic improper choosability of graphs
• Dynamic coloring parameters for graphs with given genus
• Decomposing a planar graph of girth 5 into an independent set and a forest
• Some recent progress and applications in graph minor theory
• A \((3,1)^\ast\)-choosable theorem on planar graphs
• Dirac's map-color theorem for choosability
• A short list color proof of Grötzsch's theorem
• The chromatic number of a graph of girth 5 on a fixed surface
• Five-list-coloring graphs on surfaces. I. Two lists of size two in planar graphs
• Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
• List colourings of planar graphs
• Acyclic 6-choosability of planar graphs without adjacent short cycles
• Dynamic coloring and list dynamic coloring of planar graphs
• Hadwiger's conjecture
• Multiple list colouring of planar graphs
• Acyclic 5-choosability of planar graphs without adjacent short cycles
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• What is on his mind?
• Acyclic 4-choosability of planar graphs without adjacent short cycles
• Decomposing a planar graph into an independent set and a 3-degenerate graph
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• 5-choosability of graphs with crossings far apart
• List precoloring extension in planar graphs
• On the complexity of some colorful problems parameterized by treewidth
• Planar graphs of girth at least five are square \((\delta + 2)\)-choosable
• A sufficient condition for planar graphs to be (3,1)-choosable
• Maximum 4-degenerate subgraph of a planar graph
• Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
• The number of \(k\)-colorings of a graph on a fixed surface
• Many 3-colorings of triangle-free planar graphs
• On the choice number of complete multipartite graphs with part size four
• The chromatic polynomial and list colorings
• Coloring planar homothets and three-dimensional hypergraphs
• The complexity of planar graph choosability
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• You can't paint yourself into a corner
• List homomorphisms to reflexive graphs
• An introduction to the discharging method via graph coloring
• List coloring of planar graphs with forbidden cycles
• Degree choosable signed graphs
• Planar graphs without chordal 6-cycles are 4-choosable
• A small non-\(\mathbb Z_4\)-colorable planar graph
• Dynamic list coloring of 1-planar graphs
• Acyclic 3-choosability of sparse graphs with girth at least 7
• List-coloring graphs without subdivisions and without immersions
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles
• Choosability in signed planar graphs
• 2-list-coloring planar graphs without monochromatic triangles
• New approach to nonrepetitive sequences
• A sufficient condition for a planar graph to be 4-choosable
• Facial unique-maximum colorings of plane graphs with restriction on big vertices
• A note on 3-choosability of planar graphs
• A sufficient condition for a planar graph to be 3-choosable
• The 4-choosability of planar graphs and cycle adjacency
• Extending graph colorings
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• The edge-face choosability of plane graphs
• An extension of Thomassen's result on choosability
• Graph polynomials and paintability of plane graphs
• Choosability of P 5-Free Graphs
• Circular choosability
• The Alon-Tarsi number of planar graphs
• Extension from precoloured sets of edges
• A not 3-choosable planar graph without 3-cycles
• Choosability of toroidal graphs without short cycles
• 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
• Local 7-coloring for planar subgraphs of unit disk graphs
• The 4-choosability of toroidal graphs without intersecting triangles
• A map colour theorem for the union of graphs

This page was built for publication: Every planar graph is 5-choosable

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333334)