The edge chromatic class of graphs with maximum degree at least $|V| - 3$.

Chetwynd, Amanda G. and Hilton, A. J. W. (1988) The edge chromatic class of graphs with maximum degree at least $|V| - 3$. Annals of Discrete Mathematics, 41 (C). pp. 91-110. ISSN 0167-5060

Full text not available from this repository.

Abstract

We characterize the simple graphs G which satisfy Δ(G) ≥ |V(G)| – 3 and x'(G) = Δ(G), where x'(G) is the chromatic index of G and Δ(G) is the maximum degree of G.

Item Type:
Journal Article
Journal or Publication Title:
Annals of Discrete Mathematics
Uncontrolled Keywords:
/dk/atira/pure/subjectarea/asjc/2600/2607
Subjects:
?? discrete mathematics and combinatoricsqa mathematics ??
ID Code:
20019
Deposited By:
Deposited On:
24 Nov 2008 14:40
Refereed?:
No
Published?:
Published
Last Modified:
15 Jul 2024 09:48