| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4652313 | Electronic Notes in Discrete Mathematics | 2009 | 5 Pages |
Abstract
For any c>1, we describe a linear time algorithm for fractionally edge colouring simple graphs with maximum degree at least |V|/c.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
