✦ LIBER ✦

Coloring Face-Hypergraphs of Graphs on Surfaces

✍ Scribed by André Kündgen; Radhika Ramamurthi

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 223 KB
Volume: 85
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.2001.2107

No coin nor oath required. For personal study only.

✦ Synopsis

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 coloring of its vertices from a set of k colors (from every assignment of lists of size k to its vertices) such that no edge is monochromatic. Thus a proper coloring of a face-hypergraph corresponds to a vertex coloring of the underlying graph such that no face is monochromatic. We show that hypergraphs can be extended to face-hypergraphs in a natural way and use tools from topological graph theory, the theory of hypergraphs, and design theory to obtain general bounds for the coloring and choosability problems. To show the sharpness of several bounds, we construct for every even n an n-vertex pseudo-triangulation of a surface such that every triple is a face exactly once. We provide supporting evidence for our conjecture that every plane face-hypergraph is 2-choosable and we pose several open questions, most notably: Can the vertices of a planar graph always be properly colored from lists of size 4, with the restriction on the lists that the colors come in pairs and a color is in a list if and only if its twin color is? An affirmative answer to this question would imply our conjecture, as well as the Four Color Theorem and several open problems.

📜 SIMILAR VOLUMES

On splittable colorings of graphs and hy

On splittable colorings of graphs and hypergraphs

✍ Zoltán Füredi; Radhika Ramamurthi 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

## Abstract The notion of a split coloring of a complete graph was introduced by Erdős and Gyárfás [7] as a generalization of split graphs. In this work, we offer an alternate interpretation by comparing such a coloring to the classical Ramsey coloring problem via a two‐round game played against an

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.

Face colorings of embedded graphs

✍ Dan Archdeacon 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 498 KB

We characterize those graphs which have at least one embedding into some surface such that the faces can be properly colored in four or fewer colors. Embeddings into both orientable and nonorientable surfaces are considered.

Edge-face coloring of plane graphs with

Edge-face coloring of plane graphs with maximum degree nine

✍ Jean-Sébastien Sereni; Matěj Stehlík 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 189 KB 👁 1 views

An edge-face coloring of a plane graph with edge set E and face set F is a coloring of the elements of E ∪F so that adjacent or incident elements receive different colors. Borodin [Discrete Math 128(1-3): [21][22][23][24][25][26][27][28][29][30][31][32][33] 1994] proved that every plane graph of max

Color-Critical Graphs on a Fixed Surface

✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 420 KB

dedicated to professor w. t. tutte on the occasion of his eightieth birthday Let S be an orientable surface other than the sphere and let k be a natural number. Then there are infinitely many k-color-critical graphs on S if and only if 3 k 5. In particular, if k 5, then there exists a polynomially

The number of defective colorings of gra

The number of defective colorings of graphs on surfaces

✍ Tom Rackham 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB 👁 1 views

A (k, 1)-coloring of a graph is a vertex-coloring with k colors such that each vertex is permitted at most 1 neighbor of the same color. We show that every planar graph has at least c n distinct (4, 1)-colorings, where c is constant and ≈ 1.466 satisfies 3 = 2 +1. On the other hand for any >0, we gi