The total chromatic number of any multigraph with maximum degree five is at most seven
Author:
- A.V. KostochkaAKA.V. Kostochka
- 1 December 1996
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 162 (1-3) , 199-214
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Some upper bounds on the total and list chromatic numbers of multigraphsJournal of Graph Theory, 1992
- An upper bound for the total chromatic numberGraphs and Combinatorics, 1990
- The total coloring of a multigraph with maximal degree 4Discrete Mathematics, 1977
- Critical Point-Arboritic GraphsJournal of the London Mathematical Society, 1975
- On the total coloring of certain graphsIsrael Journal of Mathematics, 1971
- On Total Chromatic Number of a GraphJournal of the London Mathematical Society, 1971
- Die Theorie der regulären graphsActa Mathematica, 1891