{
  "id": "math/0701016",
  "version": "v1",
  "published": "2006-12-31T04:41:17.000Z",
  "updated": "2006-12-31T04:41:17.000Z",
  "title": "Circular chromatic index of graphs of maximum degree 3",
  "authors": [
    "Peyman Afshani",
    "Mahsa Ghandehari",
    "Mahya Ghandehari",
    "Hamed Hatami",
    "Ruzbeh Tusserkani",
    "Xuding Zhu"
  ],
  "journal": "Journal of Graph Theory. 49(4) (2005) pp. 325-335",
  "categories": [
    "math.CO"
  ],
  "abstract": "This paper proves that if $G$ is a graph (parallel edges allowed) of maximum degree 3, then $\\chi_c'(G) \\leq 11/3$ provided that $G$ does not contain $H_1$ or $H_2$ as a subgraph, where $H_1$ and $H_2$ are obtained by subdividing one edge of $K_2^3$ (the graph with three parallel edges between two vertices) and $K_4$, respectively. As $\\chi_c'(H_1) = \\chi_c'(H_2) = 4$, our result implies that there is no graph $G$ with $11/3 < \\chi_c'(G) < 4$. It also implies that if $G$ is a 2-edge connected cubic graph, then $\\chi'(G) \\le 11/3$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-12-31T04:41:17.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "circular chromatic index",
      "maximum degree",
      "parallel edges",
      "connected cubic graph",
      "result implies"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2007math......1016A"
    }
  }
}