𝔖 Bobbio Scriptorium
✦   LIBER   ✦

3-Colorability of plane hypergraphs

✍ Scribed by S. G. Indzheyan

Publisher
Springer US
Year
1987
Tongue
English
Weight
743 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Sparse color-critical hypergraphs
Sparse color-critical hypergraphs
✍ H. L. Abbott; D. R. Hare πŸ“‚ Article πŸ“… 1989 πŸ› Springer-Verlag 🌐 English βš– 502 KB
On 3-coloring of plane triangulations
On 3-coloring of plane triangulations
✍ Atsuhiro Nakamoto; Katsuhiro Ota; Mamoru Watanabe πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 156 KB
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 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