Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics,Statistics and Probability
Reference7 articles.
1. A. V. Kostochka, “On upper bounds for the chromatic numbers of graphs,” Trudy Inst. Mat., 10, 204-226 (1988).
2. A. A. Agreev, “A triangle-free circle graph with chromatic number 5,” Discr. Math., 152, 295-298 (1996).
3. A. V. Kostochka and J. Kratochvil, “Covering and coloring polygon-circle graphs,” Discr. Math., 163, 299-305 (1997).
4. A. A. Agreev, “Every circle graph of girth at least 5 is 3-colourable,” Discr. Math., 195, 229-233 (1999).
5. A. V. Kostochka, “Coloring intersection graphs of geometric figures with a given clique number,” Contemp. Math., 342, 127-138 (2004).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Improved bounds for colouring circle graphs;Proceedings of the American Mathematical Society;2022-07-29