Acyclic coloring of graphs with some girth restriction

DOI10.1007/s10878-015-9829-2zbMath1339.05117OpenAlexW2057784932MaRDI QIDQ281769

Jian-Sheng Cai, Bin-Lu Feng, Gui Ying Yan

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9829-2

zbMATH Keywords

girthcoloringlocal lemmaacyclic coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Hardness transitions and uniqueness of acyclic colouring ⋮ Acyclic coloring of graphs with maximum degree at most six

Cites Work

• Unnamed Item
• Unnamed Item
• Generalised acyclic edge colourings of graphs with large girth
• Acyclic coloring of graphs and entropy compression method
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• Acyclic coloring of graphs
• Acyclic colorings of planar graphs
• Graph colouring and the probabilistic method

This page was built for publication: Acyclic coloring of graphs with some girth restriction