The circular chromatic index
نویسندگان
چکیده
منابع مشابه
Circular Chromatic Index of Generalized Blanusa Snarks
In his Master’s thesis, Ján Mazák proved that the circular chromatic index of the type 1 generalized Blanuša snark B n equals 3+ 2 n . This result provided the first infinite set of values of the circular chromatic index of snarks. In this paper we show the type 2 generalized Blanuša snark B n has circular chromatic index 3 + 1 b1+3n/2c . In particular, this proves that all numbers 3 + 1/n with...
متن کاملAsymptotic Lower Bounds on Circular Chromatic Index of Snarks
We prove that the circular chromatic index of a cubic graph G with 2k vertices and chromatic index 4 is at least 3 + 2/k. This bound is (asymptotically) optimal for an infinite class of cubic graphs containing bridges. We also show that the constant 2 in the above bound can be increased for graphs with larger girth or higher connectivity. In particular, if G has girth at least 5, its circular c...
متن کاملSkew Chromatic Index of Circular Ladder Graphs
Abstract. A skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. In this paper, an algorithm is determined for skew edge coloring of circular ladder graphs. Alsothe skew chromatic index of circular la...
متن کاملThe circular chromatic index of Goldberg snarks
We determine the exact values of the circular chromatic index of the Goldberg snarks, and of a related family, the twisted Goldberg snarks.
متن کاملThe Circular Chromatic Index of Flower Snarks
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 snark on 4k vertices.
متن کاملThe circular chromatic index of graphs of high girth
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 ∆ + ε.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 286 شماره
صفحات -
تاریخ انتشار 2004