✦ LIBER ✦

On -Diagonal Colorings of Embedded Graphs of Low Maximum Face Size

✍ Scribed by Hunter S. Snevily; James A. Foster

Publisher: Springer Japan
Year: 1998
Tongue: English
Weight: 145 KB
Volume: 14
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s003730050017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Face Size and the Maximum Genus of a Gra

Face Size and the Maximum Genus of a Graph 1. Simple Graphs

✍ Yuanqiu Huang; Yanpei Liu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 150 KB

This paper shows that a simple graph which can be cellularly embedded on some closed surface in such a way that the size of each face does not exceed 7 is upper embeddable. This settles one of two conjectures posed by Nedela and S8 koviera (1990, in ``Topics in Combinatorics and Graph Theory,'' pp.

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

A structural theorem on embedded graphs

A structural theorem on embedded graphs and its application to colorings

✍ Bao Gang Xu; Xiao Xu Lu 📂 Article 📅 2008 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 160 KB

On the maximum number of diagonals of a

On the maximum number of diagonals of a circuit in a graph

✍ Ram Prakash Gupta; Jeff Kahn; Neil Robertson 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 612 KB

## G, let a(G? maximum number k such that G contains a circuit with k Theorem. For any graph G with minimum valency n 2 3, a(G) z=:$(n + l)(n -2). If the equality holds and :3 is connected, then either G is isomorphic to K,,, or G is separable and each of its terminal blocks is isomorphic to K,+,