On bounding the chromatic number of L-graphs

  title={On bounding the chromatic number of L-graphs},
  author={Sean McGuinness},
  journal={Discrete Mathematics},
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 1 bounded by a function of the order of its largest clique w, where it is shown that ;1<2”4’3”4”‘~‘-“. This proves a special case of a conjecture of Gyarf& and Lehel. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications referenced by this paper.
Showing 1-5 of 5 references

On the chromatic number of multiple interval graphs and overlap graphs

Discrete Mathematics • 1985
View 5 Excerpts
Highly Influenced

Graphs and Hypergraphs

C. Berge
(North-Holland, Amsterdam, • 1973

On coloring problems of families of prototypes

J. P. Burling
Ph.D. Thesis, University of Colorado, • 1965
View 1 Excerpt

Griinbaum, On a coloring

B. E. Asplund
problem, Math. Stand • 1960

Similar Papers

Loading similar papers…