JCT
2007
14 years 15 days ago
2007
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 in...
COMBINATORICS
2006
14 years 20 days ago
2006
We determine the circular chromatic index of flower snarks, by showing that c(F3) = 7/2, c(F5) = 17/5 and c(Fk) = 10/3 for every odd integer k 7, where Fk denotes the flower snar...