𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The thickness of a minor-excluded class of graphs

✍ Scribed by Michael Jünger; Petra Mutzel; Thomas Odenthal; Mark Scharbrodt

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
327 KB
Volume
182
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Excluded-minor characterizations of anti
Excluded-minor characterizations of antimatroids arisen from posets and graph searches
✍ M. Nakamura 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 161 KB

An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is an 'antipodal' concept of matroid. We shall show that an antimatroid is derived from shelling of a poset if and only if it does not contain a minor isomorphi

Excluded–Minor Characterizations of Anti
Excluded–Minor Characterizations of Antimatroids arisen from Posets and Graph Searches
✍ M. Nakamura 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An antimatroid is a family of sets such that it contains an empty set, and it is accessible and closed under union of sets. An antimatroid is a 'dual' or 'antipodal' concept of matroill. We shall show that an antimatroid is derived from shelling of a poset if and only if it. docs not contain a mino

A Simpler Proof of the Excluded Minor Th
A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces
✍ Carsten Thomassen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 223 KB

We give a simple proof of the fact (which follows from the Robertson Seymour theory) that a graph which is minimal of genus g cannot contain a subdivision of a large grid. Combining this with the tree-width theorem and the quasi-wellordering of graphs of bounded tree-width in the Robertson Seymour t

The book thickness of a graph
The book thickness of a graph
✍ Frank Bernhart; Paul C Kainen 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 619 KB