| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4648282 | Discrete Mathematics | 2012 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Elad Horev, Matthew J. Katz, Roi Krakovski, Atsuhiro Nakamoto,