On the structure of 3-connected matroids and graphs

From MaRDI portal
Publication:1580678

DOI10.1006/eujc.2000.0407zbMath0973.05016OpenAlexW2117933520MaRDI QIDQ1580678

Haidong Wu, James G. Oxley

Publication date: 28 November 2001

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1bead42d2223b3535dfabeebc25474f249c45abc




Related Items (30)

Fork-decompositions of matroidsA longest cycle version of Tutte's wheels theoremThe structure of 3-connected matroids of path width threeOn contractible and vertically contractible elements in 3-connected matroids and graphsOn packing 3-connected restrictions into 3-connected matroidsThe 3-connected graphs with exactly \(k\) non-essential edgesInequivalent representations of matroids over prime fieldsTowards a splitter theorem for internally 4-connected binary matroids. IIIA splitter theorem on 3-connected matroidsThe excluded minors for 2- and 3-regular matroidsA splitter theorem relative to a fixed basisAn upgraded Wheels-and-Whirls theorem for 3-connected matroidsPrime vertex-minors of a prime graphOn the minor-minimal 3-connected matroids having a fixed minor.Minimally 3-connected binary matroidsConnected hyperplanes in binary matroidsA chain theorem for matroidsAlmost-graphic matroidsRestrictions as stabilizersA chain theorem for internally 4-connected binary matroidsExcluded minors are almost fragile\(N\)-detachable pairs in 3-connected matroids. I: Unveiling \(X\)Elastic elements in 3-connected matroidsOn matroids with few circuits containing a pair of elementsNon-separating cocircuits in binary matroidsTotally free expansions of matroids.On matroids of branch-width three.Matroid 3-connectivity and branch widthFan-extensions in fragile matroidsNonseparating Cocircuits in Binary Matroids



Cites Work


This page was built for publication: On the structure of 3-connected matroids and graphs