Some New Methods for Constructing 4-critical Planar Graphs

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.

12 pages, 8 figures

References in corpus (1)

• Planar 4-critical graphs with four triangles