Elsevier

Discrete Mathematics

Volumes 167–168, 15 April 1997, Pages 553-570
Discrete Mathematics

The construction and reduction of strong snarks

https://doi.org/10.1016/S0012-365X(96)00256-7Get rights and content
Under an Elsevier user license
open archive

Abstract

Let G be a 3-regular graph and let w be a weight function, w : E(G) → {1, 2}, for which the edges of weight 2 form a 1-factor of G. If w can be choosen such that there does not exist a circuit cover C for (G, w) in which each edge of G is contained in w(e) circuits of C then G is called a strong snark.

Several methods are known for constructing snarks, and the reverse process has also been studied, see for example Cameron et al. (1987). We study the decomposition and construction of strong snarks.

Cited by (0)