✦ LIBER ✦

On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs

✍ Scribed by Xin He, Huaming Zhang

Book ID: 120910013
Publisher: Springer
Year: 2012
Tongue: English
Weight: 580 KB
Volume: 68
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-012-9682-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Succinct strictly convex greedy drawing

Succinct strictly convex greedy drawing of 3-connected plane graphs

✍ Wang, Jiun-Jie; He, Xin 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 324 KB

Convex Drawings of 3-Connected Plane Gra

Convex Drawings of 3-Connected Plane Graphs

✍ Nicolas Bonichon; Stefan Felsner; Mohamed Mosbah 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 410 KB

Minimum-segment convex drawings of 3-con

Minimum-segment convex drawings of 3-connected cubic plane graphs

✍ Debajyoti Mondal, Rahnuma Islam Nishat… 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 763 KB

Cyclic Chromatic Number of 3-Connected P

Cyclic Chromatic Number of 3-Connected Plane Graphs

✍ Enomoto, Hikoe; Hornák, Mirko; Jendrol', Stanislav 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 200 KB

On 3-colorings of Plane Graphs

✍ Bao-gang Xu 📂 Article 📅 2004 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 162 KB

Non-rainbow colorings of 3-, 4- and 5-co

Non-rainbow colorings of 3-, 4- and 5-connected plane graphs

✍ Zdeněk Dvořák; Daniel Král'; Riste Škrekovski 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

## Abstract We study vertex‐colorings of plane graphs that do not contain a rainbow face, i.e., a face with vertices of mutually distinct colors. If __G__ is a 3 ‐connected plane graph with __n__ vertices, then the number of colors in such a coloring does not exceed $\lfloor{{7n-8}\over {9}}\rfloo