Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Discrete Mathematics and Combinatorics
Reference17 articles.
1. S. Baum and M. Stiebitz: Coloring of graphs without short odd paths between vertices of the same color class (2005). Manuscript, 23 PP.
2. S. A. Burr, P. Erdős and L. Lovász: On graphs of Ramsey type, Ars Combinatoria 1 (1976), 167–190.
3. M. El-Zahar and N. Sauer: The chromatic number of the product of two 4-chromatic graphs is 4, Combinatorica 5 (1985), 121–126.
4. A. Gujgiczer and G. Simonyi: On multichromatic numbers of widely colorable graphs, manuscript (2021), arXiv:2102.03120.
5. A. Gyárfás, T. Jensen and M. Stiebitz: On graphs with strongly independent colorclasses, J. Graph. Theory 46 (2004), 1–14.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献