The colour theorems of Brooks and Gallai extended

Discrete Mathematics

Volumn 162, Issue 1-3, 1996, Pages 299-303

  Kostochka, A V ^a   Stiebitz, M ^b   Wirth, B ^c  

^a NOVOSIBIRSK STATE UNIVERSITY   (Russian Federation)

^b ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0002075941     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00294-7     Document Type: Article

References (9)

1. B. Bollobás, Extremal Graph Theory (Academic Press, New York, 1978).
2. O.V. Borodin, Criterion of chromaticity of a degree prescription, in: Abstracts of IV All-Union Conf. on Theoretical Cybernetics (Novosibirsk) (1977) 127-128 (in Russian).
3. O.V. Borodin, Problems of colouring and of covering the vertex set of a graph by induced subgraphs. Ph.D. Thesis, Novosibirsk State University, Novosibirsk, 1979 (in Russian).
4. R.L. Brooks, On colouring the nodes of a network, Proc. Cambridge Phil. Soc. 37 (1941) 194-197.
5. P. Erdös, A.L. Rubin and H. Taylor, Choosability in graphs, Proc. West Coast Conf. on Combinatorics, Graph Theory and Computing, Congressus Numerantium XXVI (1979) 125-157.
6. T. Gallai, Kritische Graphen I, Publ. Math. Inst. Hung. Acad. Sci. 8 (1963) 373-395.
7. L. Lovász, Combinatorial Problems and Exercises (Problem 9.12) (Akad. Kiadó, Budapest, 1979).
8. C. Thomassen, Color-critical graphs on a fixed surface, Report, Technical University of Denmark, Lyngby, 1995.
9. V.G. Vizing, Colouring the vertices of a graph with prescribed colours, Metody Diskretnogo Analiza Teorii Kodov i Skhem No 29 (1976) 3-10 (in Russian).