✦ LIBER ✦

The book thickness of a graph

✍ Scribed by Frank Bernhart; Paul C Kainen

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 619 KB
Volume: 27
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90021-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On heuristics for determining the thickn

On heuristics for determining the thickness of a graph

✍ Robert Cimikowski 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 478 KB

On a Modified Concept of Thickness of a

On a Modified Concept of Thickness of a Graph

✍ Peter Horák; Jozef Širáń 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 91 KB

The toroidal thickness of the symmetric

The toroidal thickness of the symmetric quadripartite graph

✍ Ian Anderson 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 135 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

On the toroidal thickness of graphs

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

The book crossing number of a graph

✍ Shahrokhi, Farhad; Sz�kely, L�szl� A.; S�kora, Ondrej; Vrt'o, Imrich 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 581 KB

Let G be a graph on n vertices and m edges. The book crossing number of G is defined as the minimum number of edge crossings when the vertices of G are placed on the spine of a k-page book and edges are drawn on pages, such that each edge is contained by one page. Our main results are t w o polynomi