Non-trivial snarks with given circular chromatic index
Robert Lukoťka, Ján Mazák · Scuola Normale Superiore eBooks · 2013
We introduce a new framework designed for constructing graphs with given circular chromatic index. This framework allows construction of graphs with arbitrary maximum degree and with additional properties, e.g. high connectivity or large girth. We utilize this framework to construct a cyclically 4-edge-connected cubic graph with girth 5 and circular chromatic index r for any rational r ∈ (3, 3 + 1/4.5).