Improved upper bound for acyclic chromatic number of graphs.

MaRDI QIDQ5206433zbMATHFDO

Authors Jiguo Yu, Jiansheng Cai, Jihui Wang

Publication date 18 December 2019

zbMATH Keywords

girthcoloringacyclic coloringlefthanded local lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Improved upper bound for generalized acyclic chromatic number of graphs
• Acyclic coloring of graphs with some girth restriction
• A note on acyclic vertex-colorings
• Improved upper bounds on acyclic edge colorings
• The generalized acyclic chromatic number of graphs with large girth

Cited in

(12)

• Acyclic vertex coloring of graphs of maximum degree 5
• Acyclic coloring of graphs
• A note on acyclic vertex-colorings
• Improved upper bound for generalized acyclic chromatic number of graphs
• Acyclic coloring of graphs with some girth restriction
• On b-acyclic chromatic number of a graph
• The generalized acyclic chromatic number of graphs with large girth
• scientific article; zbMATH DE number 2192123 (Why is no real title available?)
• Acyclic coloring of graphs with maximum degree 7
• Improved upper bounds on acyclic edge colorings
• Improved bounds on coloring of graphs
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5206433)