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

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

zbMATH Keywords

chromatic indexmaximum vertex degreeVizing's theoremConjecturesmall number of vertices with maximum degree

Mathematics Subject Classification ID

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

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

• Méthode et théorème général de coloration des aretes d'un multigraphe
• The NP-Completeness of Edge-Coloring
• Regular Graphs of High Degree are 1-Factorizable
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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