{
  "id": "1106.1110",
  "version": "v1",
  "published": "2011-06-06T16:12:42.000Z",
  "updated": "2011-06-06T16:12:42.000Z",
  "title": "On edge-group choosability of graphs",
  "authors": [
    "Amir Khamseh",
    "Gholamreza Omidi"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we study the concept of edge-group choosability of graphs. We say that G is edge k-group choosable if its line graph is k-group choosable. An edge-group choosability version of Vizing conjecture is given. The evidence of our claim are graphs with maximum degree less than 4, planar graphs with maximum degree at least 11, planar graphs without small cycles, outerplanar graphs and near-outerplanar graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-06-06T16:12:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "maximum degree",
      "edge-group choosability version",
      "line graph",
      "small cycles",
      "near-outerplanar graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1106.1110K"
    }
  }
}