On fixing edges in graph minors

DOI10.1007/BF01858445zbMath0848.05018MaRDI QIDQ1911241

Talmage James Reid

Publication date: 21 April 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

characterizationminorgraph minors

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The regular matroids with no 5-wheel minor
• On singleton 1-rounded sets of matroids
• A note on nongraphic matroids
• Minors of 3-connected matroids
• Adjacency in binary matroids
• On minors of non-binary matroids
• Triangles in 3-connected matroids
• \(l\)-matrices and a characterization of binary matroids
• The smallest rounded sets of binary matroids
• Counterexamples to conjectures on 4-connected matroids
• A decomposition of the matroids with the max-flow min-cut property
• The Representation Problem for Independence Functions
• On the Uniqueness of Matroid Representations Over GF(4)
• On Nonbinary 3-Connected Matroids

This page was built for publication: On fixing edges in graph minors