Back to Search
Start Over
Graphs which are vertex-critical with respect to the edge-chromatic number
- Source :
- Mathematical Proceedings of the Cambridge Philosophical Society. 102:211-221
- Publication Year :
- 1987
- Publisher :
- Cambridge University Press (CUP), 1987.
-
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.
Details
- ISSN :
- 14698064 and 03050041
- Volume :
- 102
- Database :
- OpenAIRE
- Journal :
- Mathematical Proceedings of the Cambridge Philosophical Society
- Accession number :
- edsair.doi...........071607dbbf3393e65affd21d6760f6e9