The chromatic index of complete multipartite graphs
Authors:
- 1 June 1992
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 16 (2) , 159-163
Abstract
We show that a complete multipartite graph is class one if and only if it is not eoverfull, thus determining its chromatic index.Keywords
This publication has 8 references indexed in Scilit:
- Class 1 conditions depending on the minimum degree and the number of vertices of maximum degreeJournal of Graph Theory, 1990
- On the Δ-subgraph of graphs which are critical with respect to the chromatic indexJournal of Combinatorial Theory, Series B, 1989
- Class one graphsJournal of Combinatorial Theory, Series B, 1988
- Critical star multigraphsGraphs and Combinatorics, 1986
- Regular Graphs of High Degree are 1-FactorizableProceedings of the London Mathematical Society, 1985
- The NP-Completeness of Edge-ColoringSIAM Journal on Computing, 1981
- Graph Theory with Applications1976
- The Solution of a Timetabling ProblemIMA Journal of Applied Mathematics, 1972