On bounding the chromatic number of L-graphs
暂无分享,去创建一个
Abstract We show that the intersection graph of a collection of subsets of the plane, where each subset forms an “L” shape whose vertical stem is infinite, has its chromatic number χ bounded by a function of the order of its largest clique ω, where it is shown that χ⩽2 ( 14 3 )(4 ω−1 −1) . This proves a special case of a conjecture of Gyarfas and Lehel.
[1] András Gyárfás,et al. Covering and coloring problems for relatives of intervals , 1985, Discret. Math..
[2] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.
[3] András Gyárfás,et al. On the chromatic number of multiple interval graphs and overlap graphs , 1985, Discret. Math..
[4] Branko Grünbaum,et al. On a Coloring Problem. , 1960 .