A generalization of a graph result of D. W. Hall

DOI10.1016/S0012-365X(96)00100-8zbMATH Open0934.05033MaRDI QIDQ1367033FDOQ1367033

Authors: S. R. Kingan 

Publication date: 9 April 2000

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 952957
• A note on binary matroid with no \(M(K_{3,3})\)-minor
• On graphic matroid minors that guarantee their duals as minors
• The class of binary matroids with no \(M\)(\(K_{3,3}\))-, \(M^{*}\)(\(K_{3,3}\))-, \(M\)(\(K_{5}\))- or \(M^{*}\)(\(K_{5}\))-minor.

zbMATH Keywords

graph minorsplanar graphPetersen graphbinary matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Cites Work

• Decomposition of regular matroids
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on primitive skew curves
• Excluding the Cycle Geometries of the Kuratowski Graphs from Binary Geometries

Cited In (13)

• On internally 4-connected non-regular binary matroids
• Fine-Wilf graphs and the generalized Fine-Wilf theorem
• Title not available (Why is that?)
• The Internally 4-Connected Binary Matroids With No 𝑀(𝐾_{3,3})-Minor.
• The excluded minors for the class of matroids that are binary or ternary
• A note on binary matroid with no \(M(K_{3,3})\)-minor
• Matroids with at least two regular elements
• Hall's theorem for hypergraphs
• Towards a splitter theorem for internally 4-connected binary matroids. IX. The theorem.
• Towards a splitter theorem for internally 4-connected binary matroids. VIII: Small matroids.
• Excluding Kuratowski graphs and their duals from binary matroids
• The Hall-Janko graph and the Witt system \(W_{10}\)
• On binary matroids without a \(P_{10}\)-minor

This page was built for publication: A generalization of a graph result of D. W. Hall

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367033)