Colouring arcwise connected sets in the plane I

Graphs and Combinatorics

Volumn 16, Issue 4, 2000, Pages 429-439

  McGuinness, Sean ^a  

^a UMEÅ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 19544391233     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00007228     Document Type: Article

References (11)

1. Asplund, E., Grünbaum, B.: On a colouring problem. Math. Scand. 8, 181-188 (1960)
2. Berge, C.: Graphs and hypergraphs. Amsterdam: 1973
3. Bondy, J.A., Murty, U.S.R.: Graph theory with applications. London: Macmillan 1977
4. Burling, J.P.: On a colouring problem of families of prototypes. Ph.D Thesis, University of Colorado 1965
5. Gyárfás, A.: Problems from the world surrounding perfect graphs. Appl. Math. 3-4, 413-441 (1987)
6. Gyárfás, A.: On the chromatic number of multiple interval graphs and overlap graphs. Discrete Math. 55, 161-166 (1985)
7. Gyárfás, A., Lehel, J.: Covering and colouring problems for relatives of intervals. Discrete Math. 55, 167-180 (1985)
8. Henle, M.: A combinatorial introduction to topology. San Francisco: W.H. Freeman and co. 1979
9. Kostochka, A., Kratochvil, J.: Covering and colouring polygon circle graphs. preprint, 1995
10. Kostochka, A., Nesetril, J.: Colouring relatives of intervals of the plane I: chromatic number versus girth. Eur. J. Comb. 19, 103-110 (1998)
11. McGuinness, S.: On bounding the chromatic number of L-graphs. Discrete Math. 154, 179-187 (1996)