ISSN 1234-3099 (print version)
ISSN 2083-5892 (electronic version)
SCImago Journal Rank (SJR) 2018: 0.763
Rejection Rate (2017-2018): c. 84%
Mathematicae Graph Theory 18(2) (1998) 147-158DOI: 10.7151/dmgt.1070
Busiso P. Chisala
Department of Mathematical Sciences, Chancellor
P.O. Box 280, Zomba, Malawi
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.
Keywords: snarks, cubic graphs, sirth, edge colouring.
1991 Mathematics Subject Classification: 05C15.
Received 22 August 1997
Revised 2 May 1998