On generating snarks
Busiso P. Chisala · Discussiones Mathematicae Graph Theory · 1998
We discuss the construction of snarks (that is, cyclically 4-edge connected cubic graphs of girth at least five which are not 3-edge colourable) by using what we call colourable snark units and a welding process.