✦ LIBER ✦

On matroid separations of graphs

✍ Scribed by Klaus Truemper

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 308 KB
Volume: 11
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190110410

No coin nor oath required. For personal study only.

✦ Synopsis

Let K be a connected and undirected graph, and M be the polygon matroid of K . Assume that, for some k 2 1, the matroid M is kseparable and k-connected according to the matroid separability and connectivity definitions of W. T. Tutte. In this paper we classify the matroid kseparations of M in terms of subgraphs of K .

📜 SIMILAR VOLUMES

On removable circuits in graphs and matr

On removable circuits in graphs and matroids

✍ Lemos, Manoel; Oxley, James 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 283 KB

Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle C, the deletion of whose edges leaves a 2-connected graph. Jackson extended this by showing that C may be chosen to avoid any nominated edge of G and to have length at least d-1. This article proves

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

Matroidal families of finite connected n

Matroidal families of finite connected nonhomeomorphic graphs exist

✍ Thomas Andreae 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract A matroidal family is a nonempty set ℱ of connected finite graphs such that for every arbitrary finite graph __G__ the edge sets of the subgraphs of __G__ which are isomorphic to an element of ℱ form a matroid on the edge set of __G__. In the present paper the question whether there are

Concept of a vertex in a matroid and 3-c

Concept of a vertex in a matroid and 3-connected graphs

✍ A. K. Kelmans 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 316 KB

## Abstract The concept of a matroid vertex is introduced. The vertices of a matroid of a 3‐connected graph are in one‐to‐one correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3‐connected graphs implies isomorphism. The concept of a vert

On Circuit Valuation of Matroids

✍ Kazuo Murota; Akihisa Tamura 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 257 KB

The concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extension of the base exchange axiom for matroids. This paper gives several sets of cryptomorphically equivalent axioms of valuated matroids in terms of R ∪ -∞ -valued vectors defined on the circuits of the underly

Separation index of a graph

✍ Andrew Vince 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB

## Abstract The concepts of __separation index__ of a graph and of a surface are introduced. We prove that the separation index of the sphere is 3. Also the separation index of any graph faithfully embedded in a surface of genus __g__ is bounded by a funtion of __g__. © 2002 Wiley Periodicals, Inc.