A \(\Delta\)-subgraph condition for a graph to be class 1 (Q1087551): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(89)90005-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1991846615 / rank | |||
Normal rank | |||
Revision as of 20:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \(\Delta\)-subgraph condition for a graph to be class 1 |
scientific article |
Statements
A \(\Delta\)-subgraph condition for a graph to be class 1 (English)
0 references
1989
0 references
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.
0 references
edge-chromatic number
0 references
delta subgraph
0 references
