✦ LIBER ✦

An accessibility theorem for infinite graph minors

✍ Scribed by Reinhard Diestel

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 67 KB
Volume: 35
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200012)35:4<273::aid-jgt4>3.0.co;2-b

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Menger's theorem for infinite graphs wit

Menger's theorem for infinite graphs with ends

✍ Henning Bruhn; Reinhard Diestel; Maya Stein 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## Abstract A well‐known conjecture of Erdős states that given an infinite graph __G__ and sets __A__, ⊆ __V__(__G__), there exists a family of disjoint __A__ − __B__ paths 𝓅 together with an __A__ − __B__ separator __X__ consisting of a choice of one vertex from each path in 𝓅. There is a natural

Heat Kernel and Green Kernel Comparison

Heat Kernel and Green Kernel Comparison Theorems for Infinite Graphs

✍ Hajime Urakawa 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 396 KB

An excluded minor theorem for the octahe

An excluded minor theorem for the octahedron

✍ Maharry, John 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB

In this article it is shown that every 4-connected graph that does not contain a minor isomorphic to the octahedron is isomorphic to the square of an odd cycle.

An excluded minor theorem for the Octahe

An excluded minor theorem for the Octahedron plus an edge

✍ John Maharry 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 117 KB

## Abstract Let __G__ be the unique 4‐connected simple graph obtained by adding an edge to the Octahedron. Every 4‐connected graph that does not contain a minor isomorphic to __G__ is either planar or the square of an odd cycle. © 2007 Wiley Periodicals, Inc. J Graph Theory 57: 124–130, 2008

A Gödel theorem for an infinite-valued.

A Gödel theorem for an infinite-valued. Erweiterter Aussagenkalkül

✍ Alan Rose 📂 Article 📅 1955 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB

An 11-vertex theorem for 3-connected cub

An 11-vertex theorem for 3-connected cubic graphs

✍ R. E. L. Aldred; BauSheng; D. A. Holton; Gordon F. Royle 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 451 KB 👁 1 views

In this paper w e determine the circumstances under which a set of 11 vertices in a 3-connected cubic graph lies on a cycle. In addition, w e consider the number of such cycles that exist and characterize those graphs in which a set of 9 vertices lies in exactly two cycles.