{
  "id": "2006.07677",
  "version": "v1",
  "published": "2020-06-13T16:37:14.000Z",
  "updated": "2020-06-13T16:37:14.000Z",
  "title": "Total Coloring for some classes of Circulant graphs",
  "authors": [
    "Prajnanaswaroopa S",
    "Geetha J",
    "Somasundaram K"
  ],
  "comment": "11 pages",
  "categories": [
    "math.CO",
    "cs.DM",
    "cs.DS"
  ],
  "abstract": "The Total coloring conjecture states that any simple graph G with maximum degree D can be totally colored with at most D+2 colors. In this paper, we have obtained the total chromatic number for some classes of Cayley graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2020-06-13T16:37:14.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "G.2.2",
      "G.2.1"
    ],
    "keywords": [
      "circulant graphs",
      "total coloring conjecture states",
      "total chromatic number",
      "maximum degree",
      "cayley graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}