Author:
Liang Zuosong,Dong Yanxia,Zhao Yancai,Xing Huiyu
Funder
National Nature Science Foundation of China
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference22 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, Z.: Clique-transversal sets and weak 2-colorings in graphs of small maximum degree. Discrete Math. Theor. Comput. Sci. 11(2), 15–24 (2009)
3. Berge, C., Sterboul, F.: Equipartite colorings in graphs and hypergraphs. J. Combin. Theory (B) 22, 97–113 (1977)
4. Bacsó, G., Ryjáček, Z., Tuza, Z.: Coloring the cliques of line graphs. Discrete Math. 340, 2641–2649 (2007)
5. Charbit, P., Penev, I., Thomassé, S., Trotignon, N.: Perfect graphs of arbitrarily large clique-chromatic number. J. Combin. Theory. Ser. B 116, 456–464 (2016)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献