3-list-coloring planar graphs of girth 5

DOI10.1006/JCTB.1995.1027zbMATH Open0822.05029OpenAlexW2017043109MaRDI QIDQ1892853FDOQ1892853

Authors: Carsten Thomassen 

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

Recommendations

• A not 3-choosable planar graph without 3-cycles
• 3-list-coloring planar graphs of girth 4
• A short list color proof of Grötzsch's theorem

zbMATH Keywords

list coloringplanar graph

Mathematics Subject Classification ID

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

Cited In (83)

• Facial unique-maximum colorings of plane graphs with restriction on big vertices
• A sufficient condition for a planar graph to be 3-choosable
• Planar graphs without cycles of specific lengths
• Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
• A note on 3-choosability of planar graphs without certain cycles
• DP-3-coloring of planar graphs without 4, 9-cycles and cycles of two lengths from \(\{6,7,8\}\)
• A not 3-choosable planar graph without 3-cycles
• Choosability of toroidal graphs without short cycles
• DP-3-coloring of some planar graphs
• 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart
• 5-list-coloring planar graphs with distant precolored vertices
• The 4-choosability of plane graphs without 4-cycles
• ON (3, 1)*-CHOOSABILITY OF TOROIDAL GRAPHS
• The 3-choosability of plane graphs of girth 4
• Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk
• On group choosability of graphs. II
• Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
• On \((k, k n - k^2 - 2 k - 1)\)-choosability of \(n\)-vertex graphs
• Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle.
• Choosability, edge choosability and total choosability of outerplane graphs
• A note on list improper coloring planar graphs
• Amenable colorings
• From the plane to higher surfaces
• Planar graphs without normally adjacent short cycles
• Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• Note on 3-choosability of planar graphs with maximum degree 4
• DP-colorings of graphs with high chromatic number
• The list chromatic numbers of some planar graphs
• Bordeaux 3-color conjecture and 3-choosability
• On structure of some plane graphs with application to choosability
• Choice numbers of multi-bridge graphs
• Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs
• The asymptotic behavior of the correspondence chromatic number
• Decomposing a planar graph of girth 5 into an independent set and a forest
• A short list color proof of Grötzsch's theorem
• The chromatic number of a graph of girth 5 on a fixed surface
• Planar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosable
• 3-list-coloring graphs of girth at least five on surfaces
• 3-list-coloring planar graphs of girth 4
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• A note on the not 3-choosability of some families of planar graphs
• 5-choosability of graphs with crossings far apart
• List precoloring extension in planar graphs
• On 3-choosable planar graphs of girth at least 4
• Planar graphs without 3-, 7-, and 8-cycles are 3-choosable
• A non-3-choosable planar graph without cycles of length 4 and 5
• Many 3-colorings of triangle-free planar graphs
• On choosability with separation of planar graphs with forbidden cycles
• On 3-choosability of plane graphs without 6-, 7- and 9-cycles
• A note on 3-choosability of plane graphs under distance restrictions
• The complexity of planar graph choosability
• Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
• An introduction to the discharging method via graph coloring
• On 3-choosability of planar graphs without certain cycles
• A small non-\(\mathbb Z_4\)-colorable planar graph
• A relaxation of Havel's 3-color problem
• Acyclic 3-choosability of sparse graphs with girth at least 7
• Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
• Group coloring is \(\Pi_2^{\text{P}}\)-complete
• A note on group choosability of graphs with girth at least 4
• Choosability in signed planar graphs
• Flexibility of planar graphs -- sharpening the tools to get lists of size four
• \((3a:a)\)-list-colorability of embedded graphs of girth at least five
• Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
• Flexibility of planar graphs without 4-cycles
• 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
• Choosability with union separation of triangle-free planar graphs
• On \((3, r)\)-choosability of some planar graphs
• Sub-exponentially many 3-colorings of triangle-free planar graphs
• The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
• Planar graphs having no cycle of length 4, 7, or 9 are DP-3-colorable
• A Thomassen-type method for planar graph recoloring
• Flexibility of planar graphs of girth at least six
• Reconfiguring 10-colourings of planar graphs
• Do triangle-free planar graphs have exponentially many 3-colorings?
• IC-planar graphs are 6-choosable
• Weak degeneracy of planar graphs and locally planar graphs
• Flow extensions and group connectivity with applications
• On the number of edges in a \(K_5\)-minor-free graph of given girth
• DP-3-coloring of planar graphs without certain cycles
• Planar graphs without specific cycles are 2-degenerate
• Hyperbolic families and coloring graphs on surfaces

This page was built for publication: 3-list-coloring planar graphs of girth 5

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