On bounding the chromatic number of L-graphs

Discrete Mathematics

Volumn 154, Issue 1-3, 1996, Pages 179-187

  McGuinness, Sean ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 19544378008     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00316-O     Document Type: Article

References (5)

1. E. Asplund and B. Grünbaum, On a coloring problem, Math. Scand. 8 (1960) 181-188.
2. C. Berge, Graphs and Hypergraphs (North-Holland, Amsterdam, 1973).
3. J.P. Burling, On coloring problems of families of prototypes, Ph.D. Thesis, University of Colorado, 1965.
4. A. Gyàrfàs, On the chromatic number of multiple interval graphs and overlap graphs, Discrete Math. 55 (1985) 161-166.
5. A. Gyàrfàs and J. Lehel, Covering and coloring problems for relatives of intervals, Discrete Math. 55 (1985) 167-180.