{
  "id": "1008.2250",
  "version": "v1",
  "published": "2010-08-13T04:46:36.000Z",
  "updated": "2010-08-13T04:46:36.000Z",
  "title": "Colouring the Square of the Cartesian Product of Trees",
  "authors": [
    "David R. Wood"
  ],
  "journal": "Discrete Maths. & Theoretical Computer Science 13.2:109-112, 2011",
  "categories": [
    "math.CO"
  ],
  "abstract": "We prove upper and lower bounds on the chromatic number of the square of the cartesian product of trees. The bounds are equal if each tree has even maximum degree.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2010-08-13T04:46:36.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "cartesian product",
      "lower bounds",
      "maximum degree",
      "chromatic number"
    ],
    "tags": [
      "journal article"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2010arXiv1008.2250W"
    }
  }
}