OFFSET
1,9
COMMENTS
Snarks are cyclically 4-edge connected cubic graphs with chromatic index 4 and girth >= 5.
LINKS
G. Brinkmann, J. Goedgebeur, J. Hagglund, and K. Markstrom, Generation and properties of Snarks, arxiv 1206.6690 [math.CO], 2012-2013.
G. Brinkmann, J. Goedgebeur, J. Hagglund, and K. Markstrom, Generation and properties of Snarks, J. Comb. Theory, Series B, 103 (4) (2013), 468-488.
J. Hagglund and K. Markstrom, On stable cycles and cycle double covers of graphs with large circumference, Discrete Math., 312 (2012), 2540-2544.
House of Graphs, Snarks
Eric Weisstein's World of Mathematics, Snark
CROSSREFS
KEYWORD
nonn,hard,more
AUTHOR
Eric W. Weisstein, May 22 2007
EXTENSIONS
a(15), a(16) added from Hagglund-Markstrom by N. J. A. Sloane, Jul 26 2012
a(17), a(18) added by Jan Goedgebeur, Jul 31 2012
STATUS
approved