Abstract:In his Master's thesis, Ján Mazák proved that the circular chromatic index of the type 1 generalized Blanuša snark $B^1_n$ equals $3+{2\over 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^2_n$ has circular chromatic index $3+{1/\lfloor{1+3n/2}\rfloor}$. In particular, this proves that all numbers $3+1/n$ with $n\ge 2$ are realized as the circular chromatic index of a snark. For $n=1,2$ our pro… Show more
“…The class of generalised type 1 Blanuša snarks contains a snark on 8m + 2 vertices with circular chromatic index 3 + 2/3m for every positive integer m (see [13] for the proof). This shows that b (5,4) 8/3 = 2.6. Despite our effort we have not found any snark which would give a better upper bound on the constant b (5,4).…”
Section: Snarks With Larger Girth or Higher Connectivitymentioning
confidence: 80%
“…This shows that b (5,4) 8/3 = 2.6. Despite our effort we have not found any snark which would give a better upper bound on the constant b (5,4). We conjecture that b(5, 4) = 2.6.…”
Section: Snarks With Larger Girth or Higher Connectivitymentioning
confidence: 80%
“…The upper bound of 11/3 for bridgeless snarks was proved by Afshani et al [1]. The values of circular chromatic index have been determined for Isaac snarks [6], Goldberg snarks [4], a few classes of graphs that are trivial in some sense (for instance, see [16]), generalised Blanuša snarks [13,5], and the cubic graphs that have been constructed to show that any rational number from the interval (3, 10/3) is equal to the circular chromatic index of some cubic graph [11].…”
Section: Circular Chromatic Index Of Cubic Graphsmentioning
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 chromatic index is at least $3+2.5/k$. Our method gives an alternative proof that the circular chromatic index of the generalised type 1 Blanuša snark $B_m^1$ is $3+2/3m$.
“…The class of generalised type 1 Blanuša snarks contains a snark on 8m + 2 vertices with circular chromatic index 3 + 2/3m for every positive integer m (see [13] for the proof). This shows that b (5,4) 8/3 = 2.6. Despite our effort we have not found any snark which would give a better upper bound on the constant b (5,4).…”
Section: Snarks With Larger Girth or Higher Connectivitymentioning
confidence: 80%
“…This shows that b (5,4) 8/3 = 2.6. Despite our effort we have not found any snark which would give a better upper bound on the constant b (5,4). We conjecture that b(5, 4) = 2.6.…”
Section: Snarks With Larger Girth or Higher Connectivitymentioning
confidence: 80%
“…The upper bound of 11/3 for bridgeless snarks was proved by Afshani et al [1]. The values of circular chromatic index have been determined for Isaac snarks [6], Goldberg snarks [4], a few classes of graphs that are trivial in some sense (for instance, see [16]), generalised Blanuša snarks [13,5], and the cubic graphs that have been constructed to show that any rational number from the interval (3, 10/3) is equal to the circular chromatic index of some cubic graph [11].…”
Section: Circular Chromatic Index Of Cubic Graphsmentioning
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 chromatic index is at least $3+2.5/k$. Our method gives an alternative proof that the circular chromatic index of the generalised type 1 Blanuša snark $B_m^1$ is $3+2/3m$.
“…An analysis of the block A 2 in a manner similar to the one described in this article is essential for determining the circular chromatic index of type 2 Blanuša snarks. This has been recently done in [3] by using certain results and methods developed in the master's thesis [8] of the present author. The result of this article is also part of that thesis.…”
Abstract:We determine the exact value of the circular chromatic index of generalized Blanuša snarks of type 1 introduced by Watkins more than two decades ago. In this case, the index takes infinitely many values and can get arbitrarily close to 3. Generalized Blanuša snarks are the first explicit class with this property; until now only finitely many values of the circular chromatic index of snarks have been known.
“…This latter result was generalized to graphs with bounded maximum degree [7]. Moreover, the circular chromatic indices of several well-known classes of snarks have been determined [2,3,4,10].…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.