The chromatic index of a graph whose core has maximum degree two
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.
scientific article; zbMATH DE number 89898