{
  "id": "1105.1639",
  "version": "v1",
  "published": "2011-05-09T11:40:32.000Z",
  "updated": "2011-05-09T11:40:32.000Z",
  "title": "List (d,1)-total labelling of graphs embedded in surfaces",
  "authors": [
    "Yong Yu",
    "Xin Zhang",
    "Guizhen Liu"
  ],
  "comment": "6 pages",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "The (d,1)-total labelling of graphs was introduced by Havet and Yu. In this paper, we consider the list version of (d,1)-total labelling of graphs. Let G be a graph embedded in a surface with Euler characteristic $\\epsilon$ whose maximum degree $\\Delta(G)$ is sufficiently large. We prove that the (d,1)-total choosability $C_{d,1}^T(G)$ of $G$ is at most $\\Delta(G)+2d$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-05-09T11:40:32.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "euler characteristic",
      "list version",
      "maximum degree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1105.1639Y"
    }
  }
}