𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The classification of closed surfaces using colored graphs

✍ Scribed by Andrew Vince

Publisher
Springer Japan
Year
1993
Tongue
English
Weight
358 KB
Volume
9
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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