The chromatic index of graphs of high maximum degree
type: Item
instance of: scholarly article
title: The chromatic index of graphs of high maximum degree
zbMATH Open document ID: 0870.05022
DOI: 10.1016/0012-365X(95)00306-H
author: O. Diekmann
published in: Discrete Mathematics
publication date: 1997-06-10T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 1019022
zbMATH Keywords: chromatic index
zbMATH Keywords: edge-colouring conjecture
zbMATH Keywords: edge-connectivity
zbMATH Keywords: maximum degree
MaRDI profile type: Publication
cites work: Regular Graphs of High Degree are 1-Factorizable
cites work: 1-factorizing regular graphs of high degree - an improved bound
cites work: A \(\Delta\)-subgraph condition for a graph to be class 1
cites work: The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
cites work: Q4848784
cites work: Q3853641
cites work: Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
cites work: Q5558480
Recommended article: The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
Recommended article: Q4848784
Recommended article: Q3480060
Recommended article: The incidence chromatic number of high degree graphs
Recommended article: Q5184931
Recommended article: The total chromatic number of graphs having large maximum degree
Recommended article: Q5752590
Recommended article: The Total Chromatic Number of Graphs of High Minimum Degree
Recommended article: The total chromatic number of regular graphs of high degree
Recommended article: The chromatic index of complete multipartite graphs
description: scientific article; zbMATH DE number 1019022