arXiv Analytics

Sign in

arXiv:1508.07526 [math.CO]AbstractReferencesReviewsResources

Some New Methods for Constructing 4-critical Planar Graphs

Guofei Zhou

Published 2015-08-30Version 1

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.

Comments: 12 pages, 8 figures
Categories: math.CO
Subjects: 05C15
Keywords: planar graphs
Related articles: Most relevant | Search more
arXiv:math/0307365 [math.CO] (Published 2003-07-28)
A note on non-repetitive colourings of planar graphs
arXiv:1109.2976 [math.CO] (Published 2011-09-14)
Choosability of planar graphs of girth 5
arXiv:2009.07932 [math.CO] (Published 2020-09-16)
On Weak Flexibility in Planar Graphs

Links

Toolbox