✦ LIBER ✦

The total chromatic number of graphs having large maximum degree

✍ Scribed by A.J.W. Hilton; H.R. Hind

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 935 KB
Volume: 117
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)90329-r

No coin nor oath required. For personal study only.

✦ Synopsis

Hilton, A.J.W. and H.R. Hind, The total chromatic number ofgraphs having large maximum degree, Discrete Mathematics 117 (1993) 127-140.

The total colouring conjecture is shown to be correct for those graphs G having d(G)>21 V(G)I.

📜 SIMILAR VOLUMES

Total chromatic number of planar graphs

Total chromatic number of planar graphs with maximum degree ten

✍ Weifan Wang 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 161 KB 👁 1 views

The chromatic index of graphs with large

The chromatic index of graphs with large maximum degree

✍ Michael J. Plantholt 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 508 KB

Vizing's Theorem, any graph G has chromatic index equal either to its maximum degree A(G) or A(G) + 1. A simple method is given for determining exactly the chromatic index of any graph with 2s + 2 vertices and maximum degree 2s.

Total colorings of planar graphs with la

Total colorings of planar graphs with large maximum degree

✍ Borodin, O. V.; Kostochka, A. V.; Woodall, D. R. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 97 KB 👁 3 views

It is proved that a planar graph with maximum degree ∆ ≥ 11 has total (vertex-edge) chromatic number ∆ + 1.

The chromatic index of graphs of high ma

The chromatic index of graphs of high maximum degree

✍ K.H. Chew 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 608 KB

In this paper, we give sufficient conditions for simple graphs to be class 1. These conditions mainly depend on the edge-connectivity, maximum degree and the number of vertices of maximum degree of a graph. Using these conditions, we can extend various results of Chetwynd and Hilton, and Niessen and

Total chromatic number of regular graphs

Total chromatic number of regular graphs of odd order and high degree

✍ K.H. Chew 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 695 KB

The total chromatic number XT(G) of a graph G is the least number of colours needed to colour the edges and vertices of G so that no incident or adjacent elements receive the same colour. This paper shows that if G is odd order and regular of degree d > [(&? -1)/6]1 V(G)/, then a necessary and suffi

The total chromatic number of any multig

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

✍ A.V. Kostochka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 794 KB

The result announced in the title is proved. A new proof of the total 6-colorability of any multigraph with maximum degree 4 is also given.