✦ LIBER ✦

The chromatic index of graphs of high maximum degree

✍ Scribed by K.H. Chew

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 608 KB
Volume: 162
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00306-h

No coin nor oath required. For personal study only.

✦ Synopsis

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 Volkmann.

📜 SIMILAR VOLUMES

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.

Circular chromatic index of graphs of ma

Circular chromatic index of graphs of maximum degree 3

✍ Peyman Afshani; Mahsa Ghandehari; Mahya Ghandehari; Hamed Hatami; Ruzbeh Tusserk 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract This paper proves that if __G__ is a graph (parallel edges allowed) of maximum degree 3, then χ′~__c__~(__G__) ≤ 11/3 provided that __G__ does not contain __H__~1~ or __H__~2~ as a subgraph, where __H__~1~ and __H__~2~ are obtained by subdividing one edge of __K__ (the graph with three

The chromatic index of a graph whose cor

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

✍ A.J.W. Hilton; Zhao Cheng 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 842 KB

The total chromatic number of graphs hav

The total chromatic number of graphs having large maximum degree

✍ A.J.W. Hilton; H.R. Hind 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 935 KB

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.

The size of edge chromatic critical grap

The size of edge chromatic critical graphs with maximum degree 6

✍ Rong Luo; Lianying Miao; Yue Zhao 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 216 KB 👁 1 views

## Abstract In 1968, Vizing [Uaspekhi Mat Nauk 23 (1968) 117–134; Russian Math Surveys 23 (1968), 125–142] conjectured that for any edge chromatic critical graph ${{G}} = ({{V}}, {{E}})$ with maximum degree $\Delta$, $|{{E}}| \geq {{{1}}\over {{2}}}\{(\Delta {{- 1}})|{{V}}| + {{3}}\}$. This conject

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