{
  "id": "1911.04055",
  "version": "v1",
  "published": "2019-11-11T03:23:25.000Z",
  "updated": "2019-11-11T03:23:25.000Z",
  "title": "The cyclic matching sequenceability of regular graphs",
  "authors": [
    "Daniel Horsley",
    "Adam Mammoliti"
  ],
  "comment": "24 pages, 1 figure",
  "categories": [
    "math.CO"
  ],
  "abstract": "The cyclic matching sequenceability of a simple graph $G$, denoted $\\mathrm{cms}(G)$, is the largest integer $s$ for which there exists a cyclic ordering of the edges of $G$ so that every set of $s$ consecutive edges forms a matching. In this paper we consider the minimum cyclic matching sequenceability of $k$-regular graphs. We completely determine this for $2$-regular graphs, and give bounds for $k \\geq 3$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-11-11T03:23:25.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C70"
    ],
    "keywords": [
      "regular graphs",
      "minimum cyclic matching sequenceability",
      "simple graph",
      "largest integer",
      "consecutive edges forms"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 24,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}