A generalization of Grötzsch Theorem on the local-equitable coloring
From MaRDI portal
Publication:2110276
DOI10.1007/s00373-022-02598-5OpenAlexW4311885710MaRDI QIDQ2110276
Zuosong Liang, Juan Wang, Chun-song Bai
Publication date: 21 December 2022
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-022-02598-5
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- A linear-time algorithm for clique-coloring problem in circular-arc graphs
- Complexity of clique coloring and related problems
- Perfect graphs of arbitrarily large clique-chromatic number
- The Grötzsch theorem for the hypergraph of maximal cliques
- On the complexity of local-equitable coloring of graphs
- List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly
- 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
- Coloring the Maximal Cliques of Graphs
- On the complexity of bicoloring clique hypergraphs of graphs
- Decomposing and Clique‐Coloring (Diamond, Odd‐Hole)‐Free Graphs
