3-list-coloring planar graphs of girth 5

DOI10.1006/jctb.1995.1027zbMath0822.05029OpenAlexW2017043109MaRDI QIDQ1892853

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

zbMATH Keywords

planar graphlist coloring

Mathematics Subject Classification ID

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

Related Items (76)

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

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