On the strong chromatic number

Combinatorics Probability and Computing

Volumn 13, Issue 6, 2004, Pages 857-865

  Haxell, P E ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; INTEGER PROGRAMMING; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CHROMATIC NUMBERS; PARTIAL COLOURINGS; VERTICES;

CHROMATES;

EID: 9744274547     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548304006157     Document Type: Article

References (13)

1. Alon, N. (1988) The linear arboricity of graphs. Israel J. Math. 62 311-325.
2. Alon, N. (1992) The strong chromatic number of a graph. Random Struct. Alg. 3 1-7.
3. Alon, N. and Tarsi, M. (1992) Colourings and orientations of graphs. Combinatorica 12 125-134.
4. Bollobás, B., Erdos, P. and Szemerédi, E. (1975) On complete subgraphs of r-chromatic graphs. Discrete Math. 13 97-107.
5. Fellows, M. (1990) Transversals of vertex partitions in graphs. SIAM J. Discrete Math. 3 206-215.
6. Fleischner, H. and Stiebitz, M. (1992) A solution to a colouring problem of P. Erdos. Discrete Math. 101 39-48.
7. Fleischner, H. and Stiebitz, M. (1997) Some remarks on the cycle plus triangles problem. In The Mathematics of Paul Erdos, II, Algorithms Combin. 14 136-142.
8. Haxell, P. (2001) A note on vertex list colouring. Combin. Probab. Comput. 10 345-347.
9. Jensen, T. R. and Toft. B. (1995) Graph Coloring Problems, Wiley.
10. Jin, G. (1992) Complete subgraphs of r-partite graphs. Combin. Probab. Comput. 1 241-250.
11. Sachs, H (1993) Elementary proof or the cycle-plus-triangles theorem. In Combinatorics: Paul Endos is Eighty, Vol. 1 (D. Miklós, V. T. Sós and T. Szönyi, eds), Bolyai Soc. Math. Stud. pp. 347-359.
12. Szabó, T. and Tardos, G. Extremal problems for transversals in graphs with bounded degree. Submitted.
13. Yuster, R. (1997) Independent transversals in r-partite graphs. Discrete Math. 176 255-261.