{
  "id": "1208.3230",
  "version": "v1",
  "published": "2012-08-15T21:17:32.000Z",
  "updated": "2012-08-15T21:17:32.000Z",
  "title": "Construction of Permutation Snarks",
  "authors": [
    "Jonas Hägglund",
    "Arthur Hoffmann-Ostenhof"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "A permutation snark is a snark which has a 2-factor $F_2$ consisting of two chordless circuits; $F_2$ is called the permutation 2-factor of $G$. We construct an infinite family $\\mathcal H$ of cyclically 5-edge connected permutation snarks. Moreover, we prove for every member $G \\in \\mathcal H$ that the permutation 2-factor given by the construction of $G$ is not contained in any circuit double cover of $G$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-08-15T21:17:32.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "construction",
      "connected permutation snarks",
      "circuit double cover"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1208.3230H"
    }
  }
}