✦ LIBER ✦

Chromatic sums of nonseparable simple maps on the plane

✍ Scribed by Zhaoxiang Li; Yanpei Liu

Publisher: Springer-Verlag
Year: 2003
Tongue: English
Weight: 182 KB
Volume: 12
Category: Article
ISSN: 1598-5865
DOI: 10.1007/bf02936187

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The number of nonseparable maps on the p

The number of nonseparable maps on the projective plane

✍ Zhao-xiang Li; Li-ying Mou; Fen Lei; Jie Xu 📂 Article 📅 2010 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 166 KB

Chromatic sums of singular maps on some

Chromatic sums of singular maps on some surfaces

✍ Zhaoxiang Li; Yanpei Liu 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 196 KB

Chromatic sums of rooted triangulations

Chromatic sums of rooted triangulations on the projective plane

✍ Zhaoxiang Li; Yanpei Liu 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 197 KB

Chromaticity contour map of the RGB cube

Chromaticity contour map of the RGB cube: A simple algorithm

✍ Michael H. Brill 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 85 KB

Tight bounds on the chromatic sum of a c

Tight bounds on the chromatic sum of a connected graph

✍ Carsten Thomassen; Paul Erdös; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 1 views

On the d-distance face chromatic number

On the d-distance face chromatic number of plane graphs

✍ Mirko Horňák; Stanislav Jendrol' 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

The d-distance face chromatic number of a connected plane graph G is the minimum number of colours in such a colouring of faces of G that whenever two distinct faces are at the distance at most d, they receive distinct colours. We estimate the d-distance face chromatic number from above for connecte