Irreducible snarks of given order and cyclic connectivity

Citations of this article
Mendeley users who have this article in their library.


A snark is a "nontrivial" cubic graph whose edges cannot be properly coloured by three colours; it is irreducible if each nontrivial edge-cut divides the snark into colourable components. Irreducible snarks can be viewed as simplest uncolourable structures. In fact, all snarks can be composed from irreducible snarks in a suitable way. In this paper we deal with the problem of the existence of irreducible snarks of given order and cyclic connectivity. We determine all integers n for which there exists an irreducible snark of order n, and construct irreducible snarks with cyclic connectivity 4 and 5 of all possible orders. Moreover, we construct cyclically 6-connected irreducible snarks of each even order {greater than or slanted equal to} 210. (Cyclically 7-connected snarks are believed not to exist.). © 2006 Elsevier B.V. All rights reserved.




Máčajová, E., & Škoviera, M. (2006). Irreducible snarks of given order and cyclic connectivity. Discrete Mathematics, 306(8–9), 779–791.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free