✦ LIBER ✦

The Thickness of Graphs: A Survey

✍ Scribed by Petra Mutzel; Thomas Odenthal; Mark Scharbrodt

Book ID: 105745110
Publisher: Springer Japan
Year: 1998
Tongue: English
Weight: 270 KB
Volume: 14
Category: Article
ISSN: 0911-0119
DOI: 10.1007/pl00007219

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The book thickness of a graph

✍ Frank Bernhart; Paul C Kainen 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 619 KB

A construction of thickness-minimal grap

A construction of thickness-minimal graphs

✍ Jozef Širáň; Peter Horák 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 384 KB

The thickness of a graph G is the minimum number of planar subgraphs whose union is G. A t-minimal graph is a graph of thickness t which contains no proper subgraph of thickness t. For each t ~> 2 we present an explicit construction of an infinite number of t-minimal graphs with connectivity 2, edge

Packing of graphs—a survey

✍ H.P. Yap 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 630 KB

Supereulerian graphs: A survey

✍ Paul A. Catlin 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 996 KB

## Abstract A graph is __supereulerian__ if it has a spanning eulerian subgraph. There is a rduction method to determine whether a graph is supereulerian, and it can also be applied to study other concepts, e.g., hamiltonian line graphs, a certain type of double cycle cover, and the total interval

On the toroidal thickness of graphs

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

The thickness of a minor-excluded class

The thickness of a minor-excluded class of graphs

✍ Michael Jünger; Petra Mutzel; Thomas Odenthal; Mark Scharbrodt 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 327 KB