On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index

DOI10.1016/0095-8956(89)90045-2zbMath0626.05028OpenAlexW2091162470WikidataQ59233638 ScholiaQ59233638MaRDI QIDQ580363

D. G. Hoffman, Anthony J. W. Hilton, Amanda G. Chetwynd

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90045-2

zbMATH Keywords

induced subgraphchromatic indexmaximum degreecritical graphdelta subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items

Recent progress on edge-colouring graphs, Class one graphs, 1-factorizing regular graphs of high degree - an improved bound, Improved bounds for the chromatic index of graphs and multigraphs, The chromatic index of a graph whose core has maximum degree two, Edge and total coloring of interval graphs

Cites Work

• The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
• Unnamed Item
• Unnamed Item