| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10524218 | Operations Research Letters | 2005 | 4 Pages |
Abstract
Jensen and Toft conjectured that for a graph with an even number of vertices, either the minimum number of colours in a proper edge colouring is equal to the maximum vertex degree, or this is true in its complement. We prove a fractional version of this conjecture.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David Avis, Caterina De Simone, Bruce Reed,