𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sufficient conditions for the existence of spanning colored trees in edge-colored graphs

✍ Scribed by R. Águeda; V. Borozan; Y. Manoussakis; G. Mendy; R. Muthu

Book ID
113567595
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
220 KB
Volume
312
Category
Article
ISSN
0012-365X

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.