Author/Authors :
Horev، نويسنده , , Elad and Katz، نويسنده , , Matthew J. and Krakovski، نويسنده , , Roi and Nakamoto، نويسنده , , Atsuhiro، نويسنده ,
Abstract :
It is proved that the vertices of a cubic bipartite plane graph can be colored with four colors such that each face meets all four colors. This is tight, since any such graph contains at least six faces of size four.
