Acyclic list 7‐coloring of planar graphs
From MaRDI portal
Publication:4539872
DOI10.1002/jgt.10035zbMath1004.05029OpenAlexW2077544347MaRDI QIDQ4539872
Eric Sopena, Alexandr V. Kostochka, Andre Raspaud, Oleg V. Borodin, Dmitry G. Fon-Der-Flaass
Publication date: 11 July 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10035
Related Items (38)
Acyclic choosability of graphs with bounded degree ⋮ A sufficient condition for planar graphs to be acyclically 5-choosable ⋮ Acyclic colorings of subcubic graphs ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ Acyclic coloring of graphs without bichromatic long path ⋮ Acyclic 4-choosability of planar graphs ⋮ Improved bounds on linear coloring of plane graphs ⋮ Acyclic vertex coloring of graphs of maximum degree 5 ⋮ Acyclic 4-choosability of planar graphs without intersecting short cycles ⋮ Planar graphs without 4- and 5-cycles are acyclically 4-choosable ⋮ Every toroidal graph is acyclically 8-choosable ⋮ Acyclic 6-choosability of planar graphs without adjacent short cycles ⋮ Linear choosability of graphs ⋮ Acyclic 4-choosability of planar graphs without 4-cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ An introduction to the discharging method via graph coloring ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ A polyhedral study of the acyclic coloring problem ⋮ A note on the acyclic 3-choosability of some planar graphs ⋮ Acyclic 3-choosability of sparse graphs with girth at least 7 ⋮ What is on his mind? ⋮ Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ On acyclic 4-choosability of planar graphs without short cycles ⋮ Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable ⋮ Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6 ⋮ A polyhedral study of the acyclic coloring problem ⋮ On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 ⋮ Unnamed Item ⋮ Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles ⋮ Planar graphs without 4-cycles are acyclically 6-choosable ⋮ Linear coloring of planar graphs with large girth ⋮ Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles ⋮ Acyclic choosability of planar graphs: a Steinberg like approach ⋮ Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable ⋮ A Conjecture of Borodin and a Coloring of Grünbaum ⋮ Acyclic improper choosability of graphs
Cites Work
This page was built for publication: Acyclic list 7‐coloring of planar graphs
