{
  "id": "1505.05718",
  "version": "v1",
  "published": "2015-05-21T13:09:47.000Z",
  "updated": "2015-05-21T13:09:47.000Z",
  "title": "The game colouring number of powers of forests",
  "authors": [
    "Stephan Dominique Andres",
    "Winfried Hochstättler"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We prove that the game colouring number of the $m$-th power of a forest of maximum degree $\\Delta\\ge3$ is bounded from above by \\[\\frac{(\\Delta-1)^m-1}{\\Delta-1}+2^m+1,\\] which improves the best known bound by an asymptotic factor of 2.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-05-21T13:09:47.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15",
      "91A43",
      "05C05"
    ],
    "keywords": [
      "game colouring number",
      "th power",
      "maximum degree",
      "asymptotic factor"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2015arXiv150505718A"
    }
  }
}