A \(\Delta\)-subgraph condition for a graph to be class 1
type: Item
instance of: scholarly article
title: A \(\Delta\)-subgraph condition for a graph to be class 1
zbMATH Open document ID: 0611.05025
DOI: 10.1016/0095-8956(89)90005-1
published in: Journal of Combinatorial Theory. Series B
publication date: 1989-01-01T00:00:00Z
review text: A \(\Delta\)-subgraph \(G_{\Delta}\) of a simple graph G is the subgraph of G induced by the vertices of maximum degree \(\Delta =\Delta (G)\). We prove a number of results to the effect that, if \(\Delta\) (G) is large and the minimum degree of \(G_{\Delta}\) is at most one, then G satisfies \(\chi '(G)=\Delta (G)\), where \(\chi\) '(G) is the edge-chromatic number of G.
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 3987303
zbMATH Keywords: edge-chromatic number
zbMATH Keywords: delta subgraph
Wikidata QID: Q59233653
author: Amanda G. Chetwynd
author: A. J. W. Hilton
MaRDI profile type: Publication
full work available at URL: 0095-8956(89)90005-1
OpenAlex ID: W1991846615
cites work: The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
cites work: Q3342598
cites work: Regular Graphs of High Degree are 1-Factorizable
cites work: The chromatic index of graphs of even order with many edges
cites work: Q3033785
cites work: Q3853641
cites work: Q5181716
cites work: The chromatic index of graphs with large maximum degree
cites work: Q5558480
description: scientific article; zbMATH DE number 3987303