✦ LIBER ✦

On Improving the Edge-Face Coloring Theorem

✍ Scribed by Daniel P. Sanders; Yue Zhao

Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 135 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/pl00007248

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.

On the max-weight edge coloring problem

✍ Giorgio Lucarelli; Ioannis Milis; Vangelis T. Paschos 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 416 KB

A note on the edge theorem

✍ Y.C. Soh; Y.K. Foo 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 124 KB

On the Kneser embedded edge theorem

✍ M. M. Smirnov 📂 Article 📅 1991 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 171 KB

The greedy algorithm is optimal for on-l

The greedy algorithm is optimal for on-line edge coloring

✍ Amotz Bar-Noy; Rajeev Motwani; Joseph Naor 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 270 KB

Note on the Colored Tverberg Theorem

✍ Jiřı&#x0301; Matoušek 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 305 KB

Theorem 1. For any integers r, d>1 there exists an integer T=T(d, r), such that given sets A 1 , ..., A d+1 /R d in general position, consisting of T points each, one can find disjoint (d+1)-point sets S 1 , ..., S r such that each S i contains exactly one point of each A j , j=1, 2, ..., d+1, and t