On the complexity of local-equitable coloring in claw-free graphs with small degree

DOI10.1007/s00373-024-02826-0MaRDI QIDQ6616437

Zuosong Liang

Publication date: 9 October 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

claw-free graphssmall degreelocal-equitable coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• On the complexity of local-equitable coloring of graphs
• A generalization of Grötzsch Theorem on the local-equitable coloring
• Equitable clique-coloring in claw-free graphs with maximum degree at most 4
• Clique-coloring some classes of odd-hole-free graphs
• Coloring the Maximal Cliques of Graphs
• On the complexity of bicoloring clique hypergraphs of graphs

This page was built for publication: On the complexity of local-equitable coloring in claw-free graphs with small degree