Designs for 24-vertex snarks

2016/07/17 by Anthony D. Forbes, Forbes, Anthony D.
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Graph Labeling and Dimension Problems #graph theory and CDMA systems #math.CO

paper · pdf · doi:10.48550/arxiv.1607.04847

74 pages. Abridged version (omitting the Appendix) accepted by Utilitas Mathematica

arxiv created 2016/07/17 · arxiv updated 2016/07/19

Abstract

The design spectrum problem is solved for the thirty-eight 24-vertex non-trivial snarks.

Related

• Snark Designs
• Designs for graphs with six vertices and ten edges -- II
• Treelike snarks
• Theta Graph Designs
• On snarks that are far from being 3-edge colorable