Home > Research > Publications & Outputs > A Δ-subgraph condition for a graph to be class 1.
View graph of relations

A Δ-subgraph condition for a graph to be class 1.

Research output: Contribution to journalJournal article

Published
<mark>Journal publication date</mark>02/1989
<mark>Journal</mark>Journal of Combinatorial Theory, Series B
Issue number1
Volume46
Number of pages9
Pages (from-to)37-45
Publication StatusPublished
<mark>Original language</mark>English

Abstract

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.