Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference10 articles.
1. On a coloring problem;Asplund;Math. Scand.,1960
2. On coloring problems of families of prototypes;Burling,1965
3. The complexity of coloring circular arcs and chords;Garey;SIAM J. Algebraic Discrete Methods,1980
4. Algorithms for a maximum clique and a maximum independent set of a circle graph;Gavril;Networks,1973
5. Algorithmic Graph Theory and Perfect Graphs;Golumbic,1980
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Coloring triangle-free L-graphs with O(loglogn) colors;European Journal of Combinatorics;2024-03
2. Disjointness graphs of short polygonal chains;Journal of Combinatorial Theory, Series B;2024-01
3. Grounded L-Graphs Are Polynomially $$\chi $$-Bounded;Discrete & Computational Geometry;2023-11-16
4. Directed Acyclic Outerplanar Graphs Have Constant Stack Number;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
5. Coloring lines and Delaunay graphs with respect to boxes;Random Structures & Algorithms;2023-10-26