{
  "id": "2105.01684",
  "version": "v1",
  "published": "2021-05-04T18:09:11.000Z",
  "updated": "2021-05-04T18:09:11.000Z",
  "title": "2-distance list $(Δ+ 3)$-coloring of sparse graphs",
  "authors": [
    "Hoang La"
  ],
  "comment": "7 pages. arXiv admin note: text overlap with arXiv:2103.11687",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "A 2-distance list k-coloring of a graph is a proper coloring of the vertices where each vertex has a list of at least k available colors and vertices at distance at most 2 cannot share the same color. We prove the existence of a 2-distance list $(\\Delta + 3)$-coloring for graphs with maximum average degree less than $\\frac83$ and maximum degree $\\Delta\\geq 4$ as well as graphs with maximum average degree less than $\\frac{14}5$ and maximum degree $\\Delta\\geq 6$.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-05-04T18:09:11.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "sparse graphs",
      "maximum average degree",
      "maximum degree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 7,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}