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

Let h(G) denote the maximum vertex degree of a simple graph G. By Vizing's theorem, the chromatic index \(\chi '(G)\) of G is at most \(h(G)+1\). Graphs for which \(\chi '(G)=h(G)\) are said to be class 1, and otherwise they are class 2. There is described the structure of graphs with class 1 and class 2 respectively. Gained results provide quite strong evidence for the following conjecture. We put \(t(G)=\max_{H}\lceil 2| E(H)| /| V(H)| -1\rceil\), where the maximum is taken over all subgraphs H of G of odd order. Let \(f(G)=\max \{h(G),t(G)\}\). Conjecture. If h(G)\(\geq | V(G)|\), then \(\chi '(G)=f(G)\).