On the complexity of local-equitable coloring of graphs

DOI10.1016/j.tcs.2022.01.006OpenAlexW4206541212MaRDI QIDQ2077396

Zuosong Liang, Xinxin Yang, Juan Wang, Jun-qing Cai

Publication date: 21 February 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.006

zbMATH Keywords

complexitysplit graphchordal graphplanar graphlocal-equitable coloring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

A generalization of Grötzsch Theorem on the local-equitable coloring

Cites Work

• Unnamed Item
• A linear-time algorithm for clique-coloring problem in circular-arc graphs
• Complexity of clique coloring and related problems
• Clique-transversal sets of line graphs and complements of line graphs
• Perfect graphs of arbitrarily large clique-chromatic number
• The Grötzsch theorem for the hypergraph of maximal cliques
• Coloring the cliques of line graphs
• Clique-transversal sets and clique-coloring in planar graphs
• Clique-coloring claw-free graphs
• Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable
• Clique-coloring some classes of odd-hole-free graphs
• Complexity of clique-coloring odd-hole-free graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Coloring the Maximal Cliques of Graphs
• On the complexity of bicoloring clique hypergraphs of graphs
• Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs
• The complexity of satisfiability problems

This page was built for publication: On the complexity of local-equitable coloring of graphs