✦ LIBER ✦

A characterization of some graph classes using excluded minors

✍ Scribed by Janka Chlebíková

Publisher: Springer Netherlands
Year: 2007
Tongue: English
Weight: 153 KB
Volume: 55
Category: Article
ISSN: 0031-5303
DOI: 10.1007/s10998-007-3001-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

Exponential Speedup of Fixed-Parameter A

Exponential Speedup of Fixed-Parameter Algorithms for Classes of Graphs Excluding Single-Crossing Graphs as Minors

✍ Erik D. Demaine; Mohammadtaghi Hajiaghayi; Dimitrios M. Thilikos 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 270 KB

A Characterization of Some Graph Classes

A Characterization of Some Graph Classes with No Long Holes

✍ E. Eschen; R. Sritharan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We give a characterization of a hierarchy of graph classes with no long holes in which each class excludes some long antiholes. At one end of the hierarchy is the class of graphs with no long holes. At the other end is the class of weakly triangulated graphs. The characterization has the flavor of t

A Characterization of Graphs with No Cub

A Characterization of Graphs with No Cube Minor

✍ John Maharry 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 418 KB

In this paper it is shown that any 4-connected graph that does not contain a minor isomorphic to the cube is a minor of the line graph of V n for some n 6 or a minor of one of five graphs. Moreover, there exists a unique 5-connected graph on at least 8 vertices with no cube minor and a unique 4-conn