Chetwynd, Amanda G. and Hilton, A. J. W. (1989) A Δ-subgraph condition for a graph to be class 1. Journal of Combinatorial Theory, Series B, 46 (1). pp. 37-45. ISSN 0095-8956Full text not available from this repository.
The Δ-subgraph GΔ of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ = Δ(G). We prove a number of results to the effect that if Δ(G) is large and the minimum degree of GΔ is at most one, then G satisfies χ′(G) = Δ(G), where χ′(G) is the edge-chromatic number of G.
|Journal or Publication Title:||Journal of Combinatorial Theory, Series B|
|Subjects:||?? qa ??|
|Departments:||Faculty of Science and Technology > Mathematics and Statistics|
|Deposited By:||Prof Amanda Chetwynd|
|Deposited On:||24 Nov 2008 14:39|
|Last Modified:||15 Mar 2017 11:58|
Actions (login required)