Bounds on the generalised acyclic chromatic numbers of bounded degree graphs

DOI10.1007/S00373-005-0635-YzbMath1090.05025OpenAlexW2018867511MaRDI QIDQ2494116

Catherine Greenhill, Oleg Pikhurko

Publication date: 16 June 2006

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-005-0635-y

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (14)

Improved upper bound for generalized acyclic chromatic number of graphs ⋮ Improved bounds on the generalized acyclic chromatic number ⋮ Acyclic coloring of graphs with some girth restriction ⋮ Generalised acyclic edge colourings of graphs with large girth ⋮ Edge-coloring of plane multigraphs with many colors on facial cycles ⋮ On \(r\)-acyclic edge colorings of planar graphs ⋮ Generalized arboricity of graphs with large girth ⋮ Generalized acyclic edge colorings via entropy compression ⋮ Acyclic Edge Coloring of Triangle‐Free Planar Graphs ⋮ Acyclic edge coloring of subcubic graphs ⋮ Acyclic coloring of graphs and entropy compression method ⋮ Acyclic edge coloring of graphs with maximum degree 4 ⋮ Acyclic edge coloring of 2-degenerate graphs ⋮ The \(r\)-acyclic chromatic number of planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On acyclic colorings of planar graphs
• On acyclic colorings of graphs on surfaces
• The generalized acyclic edge chromatic number of random regular graphs
• Acyclic coloring of graphs
• The acyclic edge chromatic number of a random d‐regular graph is d + 1
• Minimal Regular Graphs of Girths Eight and Twelve
• Acyclic colorings of planar graphs

This page was built for publication: Bounds on the generalised acyclic chromatic numbers of bounded degree graphs