Improved upper bound for generalized acyclic chromatic number of graphs

DOI10.1007/s10255-018-0791-5zbMath1402.05059OpenAlexW2895064810MaRDI QIDQ1617036

Jian-Sheng Cai, Xuding Zhu

Publication date: 7 November 2018

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-018-0791-5

zbMATH Keywords

girthcoloringacyclic coloring\(r\)-acyclic coloringlopsided local lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Acyclic coloring of graphs with maximum degree 7 ⋮ Acyclic coloring of claw-free graphs with small degree ⋮ Coloring graphs without bichromatic cycles or paths

Cites Work

• Lopsided Lovász Local lemma and Latin transversals
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• Highly nonrepetitive sequences: Winning strategies from the local lemma
• Acyclic coloring of graphs
• Graph colouring and the probabilistic method
• Unnamed Item
• Unnamed Item

This page was built for publication: Improved upper bound for generalized acyclic chromatic number of graphs