Author:
Hilton A. J. W.,Johnson P. D.
Abstract
In this paper, multigraphs will have no loops. For a multigraph G, the least number of colours needed to colour the edges of G in such a way that no two edges on the same vertex of G have the same colour, is called the edge-chromatic number, or the chromatic index, of G, and denoted χ′(G). It is clear that if Δ(G) denotes the maximum degree of G, then Δ(G) ≤ χ′(G). If Δ(G) = χ′(G), then G is Class 1, and otherwise G is Class 2.
Publisher
Cambridge University Press (CUP)
Reference19 articles.
1. The chromatic index of graphs with large maximum degree
2. [5] Chetwynd A. G. and Hilton A. J. W. . The edge-chromatic class of graphs with maximum degree at least |V| –3. Proc. of conf. in memory of G. A. Dirac, to appear.
3. Definitions of criticality with respect to edge-coloring
4. On an estimate of the chromatic class of p-graph (in Russian);Vizing;Diskret. Analiz,1964
5. [6] Chetwynd A. G. and Hilton A. J. W. . The edge-chromatic class of graphs of even order with maximum degree at least |V|–4. In preparation.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献