Improved upper bound for acyclic chromatic number of graphs.

zbMATH Open1463.05155MaRDI QIDQ5206433FDOQ5206433

Authors: Jiguo Yu, Jiansheng Cai, Jihui Wang 

Publication date: 18 December 2019

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

zbMATH Keywords

girthcoloringacyclic coloringlefthanded local lemma

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (12)

• Improved upper bounds on acyclic edge colorings
• Acyclic coloring of graphs with some girth restriction
• Improved upper bound for generalized acyclic chromatic number of graphs
• Acyclic coloring of graphs with maximum degree 7
• Improved bounds on coloring of graphs
• Acyclic vertex coloring of graphs of maximum degree 5
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs
• A note on acyclic vertex-colorings
• On b-acyclic chromatic number of a graph
• Title not available (Why is that?)
• The generalized acyclic chromatic number of graphs with large girth
• Acyclic coloring of 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)