On Small Faces in 4-critical Planar Graphs

HL. Abbott1, B. Zhou1
1 Department of Mathematics University of Alberta Edmonton, Alberta Canada T6G 2G1

Abstract

It is shown that a \(4\)-critical planar graph must contain a cycle of length \(4\) or \(5\) or a face of size \(k\), where \(6 \leq k \leq 11\).