scientific article

zbMath1120.05034MaRDI QIDQ3424893

Mickaël Montassier, Wei Fan Wang, Andre Raspaud

Publication date: 5 March 2007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

cyclic coloringacyclic \(L\)-list coloringchoosability of planar graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (23)

Acyclically 4-colorable triangulations ⋮ Acyclic 5-choosability of planar graphs without adjacent short cycles ⋮ Acyclic 4-choosability of planar graphs ⋮ 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 ⋮ Acyclic 4-choosability of planar graphs without 4-cycles ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ The 4-choosability of planar graphs and cycle adjacency ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ An introduction to the discharging method via graph coloring ⋮ 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 ⋮ 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 ⋮ On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9 ⋮ On acyclically 4-colorable maximal planar graphs ⋮ 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

This page was built for publication: