Acyclic list 7‐coloring of planar graphs

DOI10.1002/JGT.10035MaRDI QIDQ4539872zbMATH OpenOpenAlexFDO

Authors Éric Sopena, Oleg V. Borodin, Dmitry G. Fon-Der-Flaass, Alexandr Kostochka, André Raspaud

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

zbMATH Keywords

chromatic numberlist colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites work

• Acyclic Colourings of Planar Graphs with Large Girth
• Acyclic colorings of planar graphs
• Colored homomorphisms of colored mixed graphs
• Every planar graph is 5-choosable
• List colourings of planar graphs
• Note to the paper of Grünbaum on acyclic colorings
• On acyclic colorings of planar graphs

Cited in

(38)

• scientific article; zbMATH DE number 6914816 (Why is no real title available?)
• Improved bounds on linear coloring of plane graphs
• A sufficient condition for planar graphs to be acyclically 5-choosable
• A polyhedral study of the acyclic coloring problem
• A polyhedral study of the acyclic coloring problem
• Planar graphs without 4- and 5-cycles are acyclically 4-choosable
• A Conjecture of Borodin and a Coloring of Grünbaum
• Planar graphs without 4-cycles are acyclically 6-choosable
• A note on the acyclic 3-choosability of some planar graphs
• Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
• Acyclic improper choosability of graphs
• On acyclic 4-choosability of planar graphs without cycles of length 4, 7 and 9
• Acyclic coloring of graphs without bichromatic long path
• Acyclic colorings of subcubic graphs
• Acyclic choosability of graphs with bounded degree
• Acyclic 4-choosability of planar graphs without 4-cycles.
• Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
• Acyclic 6-choosability of planar graphs without adjacent short cycles
• Acyclic vertex coloring of graphs of maximum degree 5
• Acyclic 4-choosability of planar graphs
• Every toroidal graph is acyclically 8-choosable
• Planar graphs without 4, 5 and 8-cycles are acyclically 4-choosable
• Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
• What is on his mind?
• Acyclic 4-choosability of planar graphs without adjacent short cycles
• Acyclic 5-choosability of planar graphs without adjacent short cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• Acyclic 5-choosability of planar graphs without 4-cycles
• On acyclic 4-choosability of planar graphs without short cycles
• Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles
• Acyclic 4-choosability of planar graphs without intersecting short cycles
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
• Acyclic choosability of planar graphs: a Steinberg like approach
• Linear choosability of graphs
• Linear coloring of planar graphs with large girth
• An introduction to the discharging method via graph coloring
• Acyclic 3-choosability of sparse graphs with girth at least 7
• Acyclic 6-choosability of planar graphs without 5-cycles and adjacent 4-cycles

This page was built for publication: Acyclic list 7‐coloring of planar graphs

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