On the structure of 3-connected matroids and graphs
type: Item
instance of: scholarly article
title: On the structure of 3-connected matroids and graphs
zbMATH Open document ID: 0973.05016
author: Haidong Wu
author: James Oxley
published in: European Journal of Combinatorics
publication date: 2001-11-28T00:00:00Z
review text: An element \(e\) of a 3-connected matroid \(M\) is essential if deleting \(e\) from \(M\), as well as contracting \(e\), destroys 3-connectivity. \textit{W. T. Tutte} [Can. J. Math. 18, 1301-1324 (1966; Zbl 0149.21501)] showed that the only 3-connected matroids in which every element is essential are wheels and whirls. In the paper under review the authors begin to explore the structure of matroids and graphs in which the set of non-essential elements is small but not empty. It is shown that every essential element in a 3-connected matroid \(M\) (that is not a wheel or a whirl) is contained in a partial wheel, called a fan, both ends of which are non-essential, i.e. if \(M\) contains non-essential elements, there must be at least two of them. Moreover, essential elements can be partitioned into classes, where two elements are in the same class if \(M\) has a fan containing both. The second main result of the paper says that a matroid \(M\) containing a fan on \(2k\) or \(2k+1\) elements, where \(k\) is at least 2, can be obtained by sticking together a \((k+1)\)-spoked wheel and a certain 3-connected minor of \(M\). These results are used by the authors in another paper [Graphs Comb. 16, No 2, 199-229 (2000; Zbl 0966.05016)] to completely determine all 3-connected matroids with exactly two non-essential elements.
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 1512039
zbMATH Keywords: 3-connectivity
zbMATH Keywords: wheel
zbMATH Keywords: whirl
zbMATH Keywords: fan
zbMATH Keywords: minor
reviewed by: Herman J. Servatius
MaRDI profile type: Publication
OpenAlex ID: W2117933520
cites work: A minimal 3-connectedness result for matroids
cites work: Some extremal connectivity results for matroids
cites work: Some Local Extremal Connectivity Results for Matroids
cites work: A simple theorem on 3-connectivity
cites work: On chains of 3-connected matroids
cites work: Finding a small 3-connected minor maintaining a fixed minor and a fixed element
cites work: A Combinatorial Model for Series-Parallel Networks
cites work: Modular Constructions for Combinatorial Geometries
cites work: Decomposition of 3-connected graphs
cites work: Extensions of Tutte's wheels-and-whirls theorem
cites work: On matroid connectivity
cites work: Planar graphs with no 6-wheel minor
cites work: On 3-connected matroids
cites work: A characterization of 3-connected graphs containing a given graph
cites work: ON MATROID CONNECTIVITY
cites work: On 3-Connected Matroids
cites work: On Nonbinary 3-Connected Matroids
cites work: The Binary Matroids With No 4-Wheel Minor
cites work: A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
cites work: The regular matroids with no 5-wheel minor
cites work: Q3135082
cites work: The smallest rounded sets of binary matroids
cites work: Q3222217
cites work: Decomposition of regular matroids
cites work: Q4871758
cites work: Partial matroid representations
cites work: Q4004142
cites work: Q3284374
cites work: Connectivity in Matroids
cites work: On contractible and vertically contractible elements in 3-connected matroids and graphs
DOI: 10.1006/EUJC.2000.0407
description: scientific article; zbMATH DE number 1512039