Author:
Agarwal Pankaj K.,Aronov Boris,Pach János,Pollack Richard,Sharir Micha
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. M. Golumbic, Algorithmic Graph Theory, Academic Press, New York, 1980.
2. A. Gyárfás, On the chromatic number of multiple interval graphs and overlap graphs, Discrete Math. 55 (1985), 161–166.
3. A. Gyárfás and J. Lehel, Covering and coloring problems for relatives of intervals, Discrete Math. 55 (1985), 167–180.
4. A. V. Kostochka, On upper bounds for the chromatic number of graphs, in: Modeli i metody optimizacii, Tom 10, Akademiya Nauk SSSR, Sibirskoe Otdelenie, 1988, 204–226.
5. J. Pach and P.K. Agarwal, Combinatorial Geometry, Wiley-Interscience, New York, 1995.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献