✦ LIBER ✦

Embedding finite graphs into graphs colored with infinitely many colors

✍ Scribed by A. Hajnal

Book ID: 112889510
Publisher: The Hebrew University Magnes Press
Year: 1991
Tongue: English
Weight: 394 KB
Volume: 73
Category: Article
ISSN: 0021-2172
DOI: 10.1007/bf02773844

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Edge Coloring of Embedded Graphs with La

Edge Coloring of Embedded Graphs with Large Girth

✍ Xuechao Li; Rong Luo 📂 Article 📅 2003 🏛 Springer Japan 🌐 English ⚖ 255 KB

Three-Coloring Graphs Embedded on Surfac

Three-Coloring Graphs Embedded on Surfaces with All Faces Even-Sided

✍ J.P. Hutchinson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 765 KB

Every graph embedded on a surface of positive genus with every face bounded by an even number of edges can be 3-colored provided all noncontractible cycles in the graph are sufficiently long. The bound of three colors is the smallest possible for this type of result. 1995 Academic Press. Inc.