Matroids and graphs with few non-essential elements
From MaRDI portal
Publication:1576575
zbMath0966.05016MaRDI QIDQ1576575
Publication date: 15 August 2000
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items (6)
A longest cycle version of Tutte's wheels theorem ⋮ On contractible and vertically contractible elements in 3-connected matroids and graphs ⋮ A splitter theorem on 3-connected matroids ⋮ Prime vertex-minors of a prime graph ⋮ On Tutte polynomial uniqueness of twisted wheels ⋮ \(N\)-detachable pairs in 3-connected matroids. III: The theorem
This page was built for publication: Matroids and graphs with few non-essential elements