{
  "id": "1404.1698",
  "version": "v2",
  "published": "2014-04-07T08:59:57.000Z",
  "updated": "2014-09-20T09:21:13.000Z",
  "title": "The Sum and Product of Chromatic Numbers of Graphs and their Line Graphs",
  "authors": [
    "Sunny Joseph Kalayathankal",
    "Susanth C"
  ],
  "comment": "8 Pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper some variations are considered. First, recall their theorem, which gives bounds on the sum and the product of the chromatic number of a graph with that of its complement. In this paper, we provide a new characterization of the other class of graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-04-07T08:59:57.000Z",
      "journal": null,
      "doi": null
    },
    {
      "version": "v2",
      "updated": "2014-09-20T09:21:13.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "chromatic number",
      "line graphs",
      "complement",
      "nordhaus-gaddum-type result",
      "upper bound"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 8,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1404.1698K"
    }
  }
}