Polychromatic 4-coloring of cubic bipartite plane graphs

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

doi:10.1016/j.disc.2011.11.016

Polychromatic 4-coloring of cubic bipartite plane graphs

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

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	715-719
Number of pages	5
Journal	Discrete Mathematics
Volume	312
Issue number	4
DOIs	https://doi.org/10.1016/j.disc.2011.11.016
State	Published - 28 Feb 2012

Keywords

Cubic bipartite plane graph
Eulerian triangulation
Polychromatic coloring

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/j.disc.2011.11.016

Cite this

@article{d0399be1e09c43efa545b8dfb73bcccb,

title = "Polychromatic 4-coloring of cubic bipartite plane graphs",

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, Eulerian triangulation, Polychromatic coloring",

author = "Elad Horev and Katz, {Matthew J.} and Roi Krakovski and Atsuhiro Nakamoto",

year = "2012",

month = feb,

day = "28",

doi = "10.1016/j.disc.2011.11.016",

language = "الإنجليزيّة",

volume = "312",

pages = "715--719",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

number = "4",

}

TY - JOUR

T1 - Polychromatic 4-coloring of cubic bipartite plane graphs

AU - Horev, Elad

AU - Katz, Matthew J.

AU - Krakovski, Roi

AU - Nakamoto, Atsuhiro

PY - 2012/2/28

Y1 - 2012/2/28

N2 - 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.

AB - 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.

KW - Cubic bipartite plane graph

KW - Eulerian triangulation

KW - Polychromatic coloring

UR - http://www.scopus.com/inward/record.url?scp=82255173796&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2011.11.016

DO - 10.1016/j.disc.2011.11.016

M3 - مقالة

SN - 0012-365X

VL - 312

SP - 715

EP - 719

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 4

ER -

Polychromatic 4-coloring of cubic bipartite plane graphs

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this