{
  "id": "1508.07526",
  "version": "v1",
  "published": "2015-08-30T02:40:18.000Z",
  "updated": "2015-08-30T02:40:18.000Z",
  "title": "Some New Methods for Constructing 4-critical Planar Graphs",
  "authors": [
    "Guofei Zhou"
  ],
  "comment": "12 pages, 8 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "A graph $G$ is said to be $k$-critical if $G$ is $k$-colorable and $G-e$ is not $k$-colorable for every edge $e$ of $G$. In this paper, we present some new methods from two or more small 4-critical graphs to construct a bigger 4-critical planar graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2015-08-30T02:40:18.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "planar graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 12,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}