Paper detail

Snark Designs

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.

preprint2015arXivOpen access

Signal facts

What is known right now

Open access1 author1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.