The chromatic index of a graph whose core has maximum degree two (Q1197023)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The chromatic index of a graph whose core has maximum degree two |
scientific article; zbMATH DE number 89898
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The chromatic index of a graph whose core has maximum degree two |
scientific article; zbMATH DE number 89898 |
Statements
The chromatic index of a graph whose core has maximum degree two (English)
0 references
16 January 1993
0 references
The authors investigate those graphs which have larger edge-chromatic number than maximum degree and which satisfy the additional condition that the subgraph induced by the vertices of maximum degree has no vertex of degree at least 3. They show that such a graph must be critical and that it is either an odd cycle or a graph with precisely two vertex- degrees.
0 references
chromatic index
0 references
critical graph
0 references
edge-chromatic number
0 references
maximum degree
0 references
odd cycle
0 references
0 references
