Home > Research > Publications & Outputs > On the Δ-subgraph of graphs which are critical ...
View graph of relations

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

Research output: Contribution to journalJournal article

Published
Close
<mark>Journal publication date</mark>04/1989
<mark>Journal</mark>Journal of Combinatorial Theory, Series B
Issue number2
Volume46
Number of pages36
Pages (from-to)240-275
Publication StatusPublished
<mark>Original language</mark>English

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.