Lancaster EPrints

On the Δ-subgraph of graphs which are critical with respect to the chromatic index.

Chetwynd, Amanda G. and Hilton, A. J. W. and Hoffman, D. G. (1989) On the Δ-subgraph of graphs which are critical with respect to the chromatic index. Journal of Combinatorial Theory : Series B, 46 (2). pp. 240-275. ISSN 0095-8956

Full text not available from this repository.

Abstract

The Δ-subgraph of a simple graph G is the subgraph of G induced by the vertices of maximum degree Δ = Δ(G). We show that a non-empty simple graph H can be a Δ-subgraph of a graph G, which is critical with respect to the chromatic index, if and only if H has no vertices of degree 0 or 1.

Item Type: Article
Journal or Publication Title: Journal of Combinatorial Theory : Series B
Subjects: Q Science > QA Mathematics
Departments: Faculty of Science and Technology > Mathematics and Statistics
VC's Office
ID Code: 20023
Deposited By: Prof Amanda Chetwynd
Deposited On: 25 Nov 2008 08:51
Refereed?: No
Published?: Published
Last Modified: 26 Jul 2012 15:36
Identification Number:
URI: http://eprints.lancs.ac.uk/id/eprint/20023

Actions (login required)

View Item