Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

On generating snarks

Busiso P. Chisala — 1998

Discussiones Mathematicae Graph Theory

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.

Page 1

Download Results (CSV)