✦ LIBER ✦

The chromatic index of a graph whose core has maximum degree two

✍ Scribed by A.J.W. Hilton; Zhao Cheng

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 842 KB
Volume: 101
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90598-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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.