Graphs with maximum degree \(6\) are acyclically \(11\)-colorable

DOI10.1016/j.ipl.2011.05.005zbMath1260.05059MaRDI QIDQ1944128

Hervé Hocquard

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.05.005

zbMATH Keywords

graph coloring; bounded degree graphs; combinatorial problems; vertex coloring; acyclic coloring

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Acyclically 4-colorable triangulations, Acyclic colorings of graphs with bounded degree, Acyclic coloring with few division vertices, Acyclic improper colouring of graphs with maximum degree 4, Acyclic choosability of graphs with bounded degree, Acyclic coloring of claw-free graphs with small degree, Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6, Acyclic coloring of graphs and entropy compression method, Acyclic coloring of graphs with maximum degree at most six, The \(r\)-acyclic chromatic number of planar graphs, Acyclic vertex coloring of graphs of maximum degree six, Acyclic coloring of graphs with maximum degree 7

Cites Work

• Unnamed Item
• Unnamed Item
• Acyclic vertex coloring of graphs of maximum degree 5
• Acyclic colorings of subcubic graphs
• Every planar graph has an acyclic 7-coloring
• On acyclic colorings of planar graphs
• Every planar graph has an acyclic 8-coloring
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Acyclic Vertex Coloring of Graphs of Maximum Degree Six
• Acyclic coloring of graphs
• Acyclic colorings of planar graphs