Article contents
92.80 The edge-choosability of the tetrahedron
Published online by Cambridge University Press: 01 August 2016
Abstract
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
![Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'](https://static.cambridge.org/content/id/urn%3Acambridge.org%3Aid%3Aarticle%3AS0025557200183895/resource/name/firstPage-S0025557200183895a.jpg)
- Type
- Notes
- Information
- Copyright
- Copyright © The Mathematical Association 2008
References
1.
Vizing, V. G.
Colouring the vertices of a graph in prescribed colours (in Russian), Diskret. Analiz. 29 (1976) pp. 3–10.Google Scholar
2.
Galvin, F.
The list-chromatic index of a bipartite multigraph, J. Combin. Theory Ser. B
63 (1995) pp. 153–158.Google Scholar
3.
Häggkvist, R. and Janssen, J.
New bounds on the list-chromatic index of the complete graph and other simple graphs, Combin. Probab. Comput. 6 (1997) pp. 295–313.Google Scholar
4.
Fiorini, S. and Wilson, R. J.
Edge-colourings of graphs, Research Notes in Mathematics, (Pitman) 1977.Google Scholar
- 4
- Cited by