✦ LIBER ✦

On 3-connected matroids

✍ Scribed by Manoel Lemos

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 997 KB
Volume: 73
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90270-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Triangles in 3-connected matroids

✍ Talmage James Reid 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 992 KB

On matroid connectivity

✍ James Oxley; Haidong Wu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 138 KB

If M is a loopless matroid in which MIX and MI Y are connected and X c~ Y is non-empty, then one easily shows that MI(X u Y) is connected. Likewise, it is straightforward to show that if G and H are n-connected graphs having at least n common vertices, then G u H is nconnected. The purpose of this n

On the Structure of 3-connected Matroids

On the Structure of 3-connected Matroids and Graphs

✍ James Oxley; Haidong Wu 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 249 KB

An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne

Theorems on matroid connectivity

✍ T. Inukai; L. Weinberg 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 135 KB

Unavoidable Minors of Large 3-Connected

Unavoidable Minors of Large 3-Connected Matroids

✍ Guoli Ding; Bogdan Oporowski; James Oxley; Dirk Vertigan 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 704 KB

This paper proves that, for every integer n exceeding two, there is a number N(n) such that every 3-connected matroid with at least N(n) elements has a minor that is isomorphic to one of the following matroids: an (n+2)-point line or its dual, the cycle or cocycle matroid of K 3, n , the cycle matro

Characterizing 3-connected planar graphs

Characterizing 3-connected planar graphs and graphic matroids

✍ Manoel Lemos; Talmage James Reid; Haidong Wu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB

## Abstract A well‐known result of Tutte states that a 3‐connected graph __G__ is planar if and only if every edge of __G__ is contained in exactly two induced non‐separating circuits. Bixby and Cunningham generalized Tutte's result to binary matroids. We generalize both of these results and give n