Some New Methods for Constructing 4-critical Planar Graphs

MaRDI QIDQ6264963zbMATH OpenFDO

Authors Guofei Zhou

Publication date 29 August 2015

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

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.

This page was built for publication: Some New Methods for Constructing 4-critical Planar Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6264963)