A not 3-choosable planar graph without 3-cycles
From MaRDI portal
Publication:1903746
DOI10.1016/0012-365X(94)00180-9zbMath0843.05034OpenAlexW2083560794MaRDI QIDQ1903746
Publication date: 13 August 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(94)00180-9
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (max. 100)
DP-3-coloring of some planar graphs ⋮ A note on the not 3-choosability of some families of planar graphs ⋮ Planar graphs without intersecting 5-cycles are 4-choosable ⋮ A non-3-choosable planar graph without cycles of length 4 and 5 ⋮ On \(t\)-common list-colorings ⋮ Do triangle-free planar graphs have exponentially many 3-colorings? ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ Many 3-colorings of triangle-free planar graphs ⋮ A small non-\(\mathbb Z_4\)-colorable planar graph ⋮ The complexity of planar graph choosability ⋮ A sufficient condition for planar graphs to be (3,1)-choosable ⋮ Colouring planar graphs with bounded monochromatic components ⋮ Kempe equivalence of 4‐critical planar graphs ⋮ Flexibility of triangle‐free planar graphs ⋮ Choosability with union separation ⋮ 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz ⋮ A note on 3-choosability of plane graphs under distance restrictions ⋮ 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart ⋮ Colouring of generalized signed triangle-free planar graphs ⋮ $(3a:a)$-List-Colorability of Embedded Graphs of Girth at Least Five ⋮ Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count ⋮ 3-list-coloring graphs of girth at least five on surfaces ⋮ On 3-choosability of plane graphs without 6-, 7- and 9-cycles ⋮ On 3-choosability of triangle-free plane graphs ⋮ 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 ⋮ Planar graphs without chordal 6-cycles are 4-choosable ⋮ A sufficient condition for DP-4-colorability ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ On the \((3, 1)\)-choosability of planar graphs without adjacent cycles of length \(5, 6, 7\) ⋮ Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable ⋮ 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 ⋮ Islands in Graphs on Surfaces ⋮ A note on list improper coloring planar graphs ⋮ Amenable colorings ⋮ A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable ⋮ Acyclic 3-choosability of sparse graphs with girth at least 7 ⋮ Smaller planar triangle-free graphs that are not 3-list-colorable ⋮ Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles ⋮ The 3-choosability of plane graphs of girth 4 ⋮ Choosability of toroidal graphs without short cycles ⋮ On choosability with separation of planar graphs without adjacent short cycles ⋮ A refinement of choosability of graphs ⋮ Choosability with separation of planar graphs without prescribed cycles ⋮ On Choosability with Separation of Planar Graphs with Forbidden Cycles ⋮ The chromatic polynomial and list colorings ⋮ Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs ⋮ On 3-choosable planar graphs of girth at least 4 ⋮ Multiple list colouring triangle free planar graphs ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ Adapted list coloring of planar graphs ⋮ Cover and variable degeneracy ⋮ DP-4-colorability of two classes of planar graphs ⋮ Note on 3-choosability of planar graphs with maximum degree 4 ⋮ Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor ⋮ Planar graphs without 3-, 7-, and 8-cycles are 3-choosable ⋮ Distributed coloring in sparse graphs with fewer colors ⋮ The 4-choosability of plane graphs without 4-cycles ⋮ Exponentially many 3-colorings of planar triangle-free graphs with no short separating cycles ⋮ On choosability with separation of planar graphs with lists of different sizes
Cites Work
This page was built for publication: A not 3-choosable planar graph without 3-cycles
