The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
From MaRDI portal
Publication:752723
DOI10.1016/0095-8956(90)90129-NzbMath0716.05021OpenAlexW1969442805WikidataQ59233624 ScholiaQ59233624MaRDI QIDQ752723
Amanda G. Chetwynd, Anthony J. W. Hilton
Publication date: 1990
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(90)90129-n
chromatic indexmaximum vertex degreeVizing's theoremConjecturesmall number of vertices with maximum degree
Related Items (15)
The number of disjoint perfect matchings in semi-regular graphs ⋮ How to find overfull subgraphs in graphs with large maximum degree ⋮ Edge-colouring of join graphs ⋮ A \(\Delta\)-subgraph condition for a graph to be class 1 ⋮ Critical star multigraphs ⋮ Recent progress on edge-colouring graphs ⋮ The chromatic index of graphs of high maximum degree ⋮ Edge coloring regular graphs of high degree ⋮ On the size of graphs of class 2 whose cores have maximum degree two ⋮ Two conjectures on edge-colouring ⋮ Edge-colouring of regular graphs of large degree ⋮ The total chromatic number of graphs having large maximum degree ⋮ Recent results on the total chromatic number ⋮ On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index ⋮ The spectral radius of edge chromatic critical graphs
Cites Work
This page was built for publication: The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
