Author:
Lasoń Michał,Micek Piotr,Pawlik Arkadiusz,Walczak Bartosz
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference16 articles.
1. Asplund, E., Grünbaum, B.: On a colouring problem. Math. Scand. 8, 181–188 (1960)
2. Burling, J.P.: On coloring problems of families of prototypes. PhD thesis, University of Colorado, Boulder (1965)
3. Fox, J., Pach, J.: A separator theorem for string graphs and its applications. Comb. Probab. Comput. 19(3), 371–390 (2010)
4. Fox, J., Pach, J.: Coloring $$K_k$$ K k -free intersection graphs of geometric objects in the plane. Eur. J. Comb. 33(5), 853–866 (2012)
5. Gyárfás, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discrete Math. 55(2), 161–166 (1985)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Coloring triangle-free L-graphs with O(loglogn) colors;European Journal of Combinatorics;2024-03
2. Grounded L-Graphs Are Polynomially $$\chi $$-Bounded;Discrete & Computational Geometry;2023-11-16
3. On the chromatic number of disjointness graphs of curves;Journal of Combinatorial Theory, Series B;2020-09
4. A survey of χ‐boundedness;Journal of Graph Theory;2020-08-24
5. Conflict-Free Coloring of String Graphs;Discrete & Computational Geometry;2020-02-04