✦ LIBER ✦

A Hajós-like theorem for list coloring

✍ Scribed by Sylvain Gravier

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 210 KB
Volume: 152
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(95)00350-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extension for Hajós' theorem

✍ Keresztély Corrádi; Sándor Szabó 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 442 KB

Extremal graphs for the list-coloring ve

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum

✍ Simone Dantas; Sylvain Gravier; Frédéric Maffray 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 215 KB

We characterize the graphs G such that Ch(G) + Ch( G) = n + 1, where Ch(G) is the choice number (list-chromatic number) of G and n is its number of vertices.

Extremal graphs for the list-coloring ve

Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum

✍ Simone Dantas; Sylvain Gravier; Frederic Maffray; Bojan Mohar 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 267 KB

A cofinal coloring theorem for partially

A cofinal coloring theorem for partially ordered algebras

✍ George M. Bergman; Irving Kaplansky 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 286 KB

A decomposition for total-coloring parti

A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs

✍ Raphael C. S. Machado; Celina M. H. de Figueiredo 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

A six-color theorem for the edge-face co

A six-color theorem for the edge-face coloring of plane graphs

✍ Cuiqin Lin; Guanzhang Hu; Zhongfu Zhang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 218 KB

It was shown (Kronk and Mitchen, 1973) that the set of vertices, edges and faces of any normal map on the sphere can be colored with seven colors. In this paper we solve a somewhat different problem: the set of edges and faces of any plane graph with A ~< 3 can be colored by six colors.