✦ LIBER ✦

Polychromatic 4-coloring of cubic bipartite plane graphs

✍ Scribed by Elad Horev; Matthew J. Katz; Roi Krakovski; Atsuhiro Nakamoto

Book ID: 113567516
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 249 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.11.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polychromatic Colorings of Plane Graphs

✍ Noga Alon; Robert Berke; Kevin Buchin; Maike Buchin; Péter Csorba; Saswata Shann 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 546 KB

Polychromatic 4-coloring of cubic even e

Polychromatic 4-coloring of cubic even embeddings on the projective plane

✍ Kobayashi, Momoko; Nakamoto, Atsuhiro; Yamaguchi, Tsubasa 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 533 KB

Polychromatic colorings of bounded degre

Polychromatic colorings of bounded degree plane graphs

✍ Elad Horev; Roi Krakovski 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

## Abstract A __polychromatic k__‐__coloring__ of a plane graph __G__ is an assignment of __k__ colors to the vertices of __G__ such that every face of __G__ has __all k__ colors on its boundary. For a given plane graph __G__, one seeks the __maximum__ number __k__ such that __G__ admits a polychro

Interval coloring of (3,4)-biregular bip

Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs

✍ A. V. Pyatkin 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 80 KB

## Abstract An interval coloring of a graph is a proper edge coloring such that the set of used colors at every vertex is an interval of integers. Generally, it is an NP‐hard problem to decide whether a graph has an interval coloring or not. A bipartite graph __G__ = (__A__,__B__;__E__) is (α, β)‐b

A new invariant of plane bipartite cubic

A new invariant of plane bipartite cubic graphs

✍ François Jaeger 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 999 KB

Balanced coloring of bipartite graphs

✍ Uriel Feige; Shimon Kogan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB

## Abstract Given a bipartite graph __G__(__U__∪__V, E__) with __n__ vertices on each side, an independent set __I__∈__G__ such that |__U__∩__I__|=|__V__∩__I__| is called a balanced bipartite independent set. A balanced coloring of __G__ is a coloring of the vertices of __G__ such that each color c