Acyclic coloring of claw-free graphs with small degree

DOI10.1016/j.dam.2022.07.001zbMath1497.05102OpenAlexW4285585269MaRDI QIDQ2172408

Zuosong Liang, Juan Wang, Lian-Ying Miao, Jian-Sheng Cai

Publication date: 15 September 2022

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

Full work available at URL: https://doi.org/10.1016/j.dam.2022.07.001

zbMATH Keywords

claw-free graphvertex coloringacyclic coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

Hardness transitions and uniqueness of acyclic colouring

Cites Work

• Unnamed Item
• Acyclic colorings of graphs with bounded degree
• Acyclic vertex coloring of graphs of maximum degree 5
• Acyclic coloring of graphs without bichromatic long path
• On acyclic colorings of planar graphs
• Improved upper bound for generalized acyclic chromatic number of graphs
• Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
• Acyclic \(L\)-coloring of graphs with maximum degrees 5 and 6
• Acyclic coloring of graphs with maximum degree at most six
• Acyclic coloring of graphs of maximum degree five: nine colors are enough
• Acyclic vertex coloring of graphs of maximum degree six
• Acyclic coloring of graphs with maximum degree 7
• Acyclic Vertex Coloring of Graphs of Maximum Degree Six
• Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree
• Graphs with maximum degree 5 are acyclically 7-colorable
• Acyclic coloring of graphs
• Acyclic colorings of planar graphs