Funder
National Nature Science Foundation of China
Natural Science Foundation of Guangxi Province
Publisher
Springer Science and Business Media LLC
Reference7 articles.
1. Bacsó, G., Gravier, S., Gyárfás, A., Preissmann, M., Sebő, A.: Coloring the maximal cliques of graphs. SIAM J. Discrete Math. 17, 361–376 (2004)
2. Bacsó, G., Tuza, Zs.: Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Discrete Math. Theoret. Comput. Sci. 11(2), 15–24 (2009)
3. Défossez, D.: Clique coloring some classess of odd-hole-free graphs. J. Graph Theory 53, 233–249 (2006)
4. Kratochvíl, J., Tuza, Zs.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45, 40–54 (2002)
5. Liang, Z., Wang, J., Cai, J., Yang, X.: On the complexity of local-equitable coloring of graphs. Theoret. Comput. Sci. 906, 76–82 (2022)