✦ LIBER ✦

Thickness and coarseness of graphs

✍ Scribed by Paul C. Kainen

Book ID: 112965343
Publisher: Vandenhoeck & Ruprecht
Year: 1973
Tongue: German
Weight: 373 KB
Volume: 39
Category: Article
ISSN: 0025-5858
DOI: 10.1007/bf02992822

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coarse Differentiation and Multi-flows i

Coarse Differentiation and Multi-flows in Planar Graphs

✍ James R. Lee; Prasad Raghavendra 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 490 KB

On the genus and thickness of graphs

✍ Kouhei Asano 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 306 KB

On graph thickness, geometric thickness,

On graph thickness, geometric thickness, and separator theorems

✍ Christian A. Duncan 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 196 KB

On the toroidal thickness of graphs

✍ Ian Anderson 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 297 KB

Thickness-two graphs part one: New nine-

Thickness-two graphs part one: New nine-critical graphs, permuted layer graphs, and Catlin's graphs

✍ Debra L. Boutin; Ellen Gethner; Thom Sulanke 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 605 KB

## Abstract The purpose of this article is to offer new insight and tools toward the pursuit of the largest chromatic number in the class of thicknesstwo graphs. At present, the highest chromatic number known for a thickness‐two graph is 9, and there is only one known color‐critical such graph. We

The Thickness of Graphs: A Survey

✍ Petra Mutzel; Thomas Odenthal; Mark Scharbrodt 📂 Article 📅 1998 🏛 Springer Japan 🌐 English ⚖ 270 KB