4-critical 4-valent planar graphs constructed with crowns.
Gerhard Koester · MATHEMATICA SCANDINAVICA · 1990
A construction of arbitrarily large 4-critical 4-valent planar graphs with aid of socalled «crowns» is given which also proves a conjecture of B. Grunbaum. Furthermore some coloring properties of the aid graphs are derived