Generalised acyclic edge colourings of graphs with large girth

DOI10.1016/J.DISC.2006.09.004zbMath1118.05034OpenAlexW1969104457MaRDI QIDQ879345

Stefanie Gerke, Melanie Raemy

Publication date: 11 May 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.09.004

zbMATH Keywords

local lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Improved bounds on the generalized acyclic chromatic number ⋮ Acyclic coloring of graphs with some girth restriction ⋮ Edge-coloring of plane multigraphs with many colors on facial cycles ⋮ Improved bounds on linear coloring of plane graphs ⋮ 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 edge coloring of graphs with maximum degree 4 ⋮ Acyclic edge coloring of 2-degenerate graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• Acyclic edge colorings of graphs
• The generalized acyclic edge chromatic number of random regular graphs
• Acyclic coloring of graphs

This page was built for publication: Generalised acyclic edge colourings of graphs with large girth