Polychromatic 4-coloring of cubic bipartite plane graphs

Elad Horev, Matthew J. Katz, Roi Krakovski, Atsuhiro Nakamoto

Research output: Contribution to journalArticlepeer-review

13 Scopus citations


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.

Original languageEnglish
Pages (from-to)715-719
Number of pages5
JournalDiscrete Mathematics
Issue number4
StatePublished - 28 Feb 2012


  • Cubic bipartite plane graph
  • Eulerian triangulation
  • Polychromatic coloring

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Polychromatic 4-coloring of cubic bipartite plane graphs'. Together they form a unique fingerprint.

Cite this