English

Construction of Permutation Snarks

Combinatorics 2012-08-17 v1

Abstract

A permutation snark is a snark which has a 2-factor F2F_2 consisting of two chordless circuits; F2F_2 is called the permutation 2-factor of GG. We construct an infinite family H\mathcal H of cyclically 5-edge connected permutation snarks. Moreover, we prove for every member GHG \in \mathcal H that the permutation 2-factor given by the construction of GG is not contained in any circuit double cover of GG.

Cite

@article{arxiv.1208.3230,
  title  = {Construction of Permutation Snarks},
  author = {Jonas Hägglund and Arthur Hoffmann-Ostenhof},
  journal= {arXiv preprint arXiv:1208.3230},
  year   = {2012}
}
R2 v1 2026-06-21T21:51:12.839Z