The total chromatic number of any multigraph with maximum degree five is at most seven

Discrete Mathematics

Volumn 162, Issue 1-3, 1996, Pages 199-214

  Kostochka, A V ^a  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010814739     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0012-365X(95)00286-6     Document Type: Article

References (16)

1. M. Behzad, The total chromatic number of a graph: a survey, in: D.J.A. Welsh, ed., Mathematics and its Applications (Proc. Conf. Oxford, 1969), (Academic Press, New York, 1971) 1-9.
2. O.V. Borodin, On partition of graphs into degenerate subgraphs, in: Methods of Discrete Analysis in the Theory of Graphs and Logical Functions, 28 (1976) 3-11 (in Russian).
3. O.V. Borodin, On the total coloring of planar graphs, J. Reine Angew. Math. 394 (1989) 180-185.
4. A. Chetwynd and R. Häggkvist, Some upper bounds on the total and list chromatic numbers of multigraphs, J. Graph Theory 16 (1992) 503-516.
5. A. Chetwynd and R. Häggkvist, An improvement of Hind's upper bound on the total chromatic number, Research Report No 9, Univ. of Umea (Sweden), 1993.
6. H. Hind, An upper bound for the total chromatic number, Graphs Combin. 6 (1990) 153-160.
7. A.V. Kostochka, The total coloring of a multigraph with maximal degree 4, Discrete Math. 17 (1977) 161-163.
8. A.V. Kostochka, An analog of the Shannon bound for total coloring, in: Methods of Discrete Analysis in the Solution of Combinatorial Problems, 30 (1977) 13-22 (in Russian).
9. A.V. Kostochka, Upper bounds on chromatic functions of graphs, Doct. Thesis, Novosibirsk, 1978 (in Russian).
10. A.V. Kostochka, Exact upper bound on the total chromatic number of multigraphs, in: Proceedings of the 24th Int. Sci. Colloq. of Tech. Univ. of Illmenau (Illmenau, GDR, 1979), vol. 5 (row B2-B3), 33-36 (in Russian).
11. H.V. Kronk and J. Mitchem, Critical point-arboritic graphs, J. London Math. Soc., (Second Series) 9 (1975) 459-466.
12. L. Lovász and M.D. Plummer, Matching Theory (North-Holland, Amsterdam, 1986).
13. J. Petersen, Die Theorie der reguláren Graphen, Acta Math., 15 (1891) 193-220.
14. M. Rosenfeld, On the total coloring of certain graphs, Israel J. Math. 9 (1971) 396-402.
15. W. Vijayaditya, On total coloring of a graph, J. London Math. Soc. (Second Series) 3 (1971) 405-408.
16. V.G. Vizing, Some unsolved problems in graph theory, Uspeki Mat. Nauk 23 (1968) 117-134 (in Russian).