✦ LIBER ✦

A fast parallel coloring of planar graphs with five colors

✍ Scribed by Joseph Naor

Book ID: 113163017
Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 251 KB
Volume: 25
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(87)90092-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast parallel algorithm to color a gra

A fast parallel algorithm to color a graph with Δ colors

✍ Mauricio Karchmer; Joseph Naor 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 502 KB

Acyclic edge coloring of planar graphs w

Acyclic edge coloring of planar graphs with colors

✍ Dávid Hudák; František Kardoš; Borut Lužar; Roman Soták; Riste Škrekovski 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 469 KB

Injective colorings of planar graphs wit

Injective colorings of planar graphs with few colors

✍ Borut Lužar; Riste Škrekovski; Martin Tancer 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 945 KB

A class of planar four-colorable graphs

✍ Ezra Brown; Lee Johnson 📂 Article 📅 1972 🏛 The Hebrew University Magnes Press 🌐 English ⚖ 164 KB

Coloring the square of a planar graph

✍ Jan van den Heuvel; Sean McGuinness 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

## Abstract We prove that for any planar graph __G__ with maximum degree Δ, it holds that the chromatic number of the square of __G__ satisfies χ(__G__^2^) ≤ 2Δ + 25. We generalize this result to integer labelings of planar graphs involving constraints on distances one and two in the graph. © 2002

Colorability of Planar Graphs with Isola

Colorability of Planar Graphs with Isolated Nontriangular Faces

✍ Mark N. Ellingham; Herbert Fleischner; Martin Kochol; Emanuel Wenger 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 224 KB