| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436642 | Theoretical Computer Science | 2007 | 9 Pages |
Abstract
We consider the following conjecture:Let G be a k-regular simple graph with an even number n of vertices. If k≥n/2then G is k-edge-colourable.We show that this conjecture is true for graphs that are join of two graphs and we provide a polynomial time algorithm for finding a k-edge-colouring of these graphs.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
