The Open UniversitySkip to content

Snark designs

Forbes, A. D. (2019). Snark designs. Utilitas Mathematica (In Press).

Google Scholar: Look up in Google Scholar


The main aim of this paper is to solve the design spectrum problem for Tietze's graph, the two 18-vertex Blanusa snarks, the six snarks on 20 vertices (including the flower snark J5), the twenty snarks on 22 vertices (including the two Loupekine snarks) and Goldberg's snark 3. Together with the Petersen graph (for which the spectrum has already been computed) this list includes all non-trivial snarks of up to 22 vertices. We also give partial results for a selection of larger graphs: the two Celmins-Swart snarks, the 26- and 34-vertex Blanusa snarks, the flower snark J7, the double star snark, Zamfirescu's graph, Goldberg's snark 5, the Szekeres snark and the Watkins snark.

Item Type: Journal Item
Copyright Holders: 2015 The Author
ISSN: 0315-3681
Extra Information: 92 p.
NYP 09/05/2019 AW
NYP 06/09/2019 AW
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Related URLs:
Item ID: 56584
Depositing User: Anthony Forbes
Date Deposited: 08 Oct 2018 08:24
Last Modified: 06 Sep 2019 09:18
Share this page:

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU