✦ LIBER ✦

Five-Coloring Maps on Surfaces

✍ Scribed by C. Thomassen

Book ID: 102970655
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 688 KB
Volume: 59
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1993.1057

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Five-coloring planar maps

✍ Walter Meyer 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Acyclick-strong coloring of maps on surf

Acyclick-strong coloring of maps on surfaces

✍ O. V. Borodin; A. V. Kostochka; A. Raspaud; E. Sopena 📂 Article 📅 2000 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 585 KB

Coloring Locally Bipartite Graphs on Sur

Coloring Locally Bipartite Graphs on Surfaces

✍ Bojan Mohar; Paul D. Seymour 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 129 KB

It is proved that there is a function f: N Q N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-width \ f(g). Then (i) If every contractible 4-cycle of G is facial and there is a face of size > 4, then G is 3-colorable.

Five-coloring graphs on the Klein bottle

✍ Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas; Carl Yerger 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 554 KB

Coloring Face-Hypergraphs of Graphs on S

Coloring Face-Hypergraphs of Graphs on Surfaces

✍ André Kündgen; Radhika Ramamurthi 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 223 KB

The face-hypergraph, H(G), of a graph G embedded in a surface has vertex set V(G), and every face of G corresponds to an edge of H(G) consisting of the vertices incident to the face. We study coloring parameters of these embedded hypergraphs. A hypergraph is k-colorable (k-choosable) if there is a c

On colorings of maps

✍ M.A. van Hartskamp; J. Vermeer 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 610 KB