| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657374 | Journal of Combinatorial Theory, Series B | 2007 | 13 Pages |
Abstract
We show that for each ε>0 and each integer Δ⩾1, there exists a number g such that for any graph G of maximum degree Δ and girth at least g, the circular chromatic index of G is at most Δ+ε.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
