The chromatic index of graphs of high maximum degree

DOI10.1016/0012-365X(95)00306-HzbMath0870.05022MaRDI QIDQ1356656

O. Diekmann

Publication date: 10 June 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

chromatic indexedge-connectivitymaximum degreeedge-colouring conjecture

Mathematics Subject Classification ID

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

Related Items (1)

The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)

Cites Work

• The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
• A \(\Delta\)-subgraph condition for a graph to be class 1
• 1-factorizing regular graphs of high degree - an improved bound
• Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
• Regular Graphs of High Degree are 1-Factorizable
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The chromatic index of graphs of high maximum degree