Some New Methods for Constructing 4-critical Planar Graphs

Guofei Zhou

Some New Methods for Constructing 4-critical Planar Graphs

Combinatorics 2015-09-03 v2

Authors: Guofei Zhou

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 larger 4-critical planar graphs.

Keywords

graph coloring graph theory graph pebbling

Cite

@article{arxiv.1508.07526,
  title  = {Some New Methods for Constructing 4-critical Planar Graphs},
  author = {Guofei Zhou},
  journal= {arXiv preprint arXiv:1508.07526},
  year   = {2015}
}

Comments

12 pages, 8 figures

Related papers

View all related →