Title of article
Polychromatic 4-coloring of cubic bipartite plane graphs
Author/Authors
Horev، نويسنده , , Elad and Katz، نويسنده , , Matthew J. and Krakovski، نويسنده , , Roi and Nakamoto، نويسنده , , Atsuhiro، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2012
Pages
5
From page
715
To page
719
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.
Keywords
Cubic bipartite plane graph , Polychromatic coloring , Eulerian triangulation
Journal title
Discrete Mathematics
Serial Year
2012
Journal title
Discrete Mathematics
Record number
1599855
Link To Document