Name
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.disc.2011.11.016 | Discrete Mathematics |
Keywords | Field | DocType |
cubic bipartite plane graph,eulerian triangulation,polychromatic coloring | Discrete mathematics,Edge coloring,Complete coloring,Complete bipartite graph,Combinatorics,Edge-transitive graph,List coloring,Foster graph,1-planar graph,Mathematics,Graph coloring | Journal |
Volume | Issue | ISSN |
312 | 4 | 0012-365X |
Citations | PageRank | References |
6 | 0.51 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elad Horev | 1 | 22 | 3.75 |
| Matthew J. Katz | 2 | 225 | 19.92 |
| Roi Krakovski | 3 | 29 | 5.58 |
| Atsuhiro Nakamoto | 4 | 333 | 51.63 |