{
  "id": "math/0307365",
  "version": "v1",
  "published": "2003-07-28T16:06:00.000Z",
  "updated": "2003-07-28T16:06:00.000Z",
  "title": "A note on non-repetitive colourings of planar graphs",
  "authors": [
    "Narad Rampersad"
  ],
  "comment": "4 pages, 2 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "Alon et al. introduced the concept of non-repetitive colourings of graphs. Here we address some questions regarding non-repetitive colourings of planar graphs. Specifically, we show that the faces of any outerplanar map can be non-repetitively coloured using at most five colours. We also give some lower bounds for the number of colours required to non-repetitively colour the vertices of both outerplanar and planar graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2003-07-28T16:06:00.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "planar graphs",
      "non-repetitively colour",
      "outerplanar map",
      "lower bounds",
      "questions regarding non-repetitive colourings"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2003math......7365R"
    }
  }
}