Connected hyperplanes in binary matroids

DOI10.1006/jctb.1999.1949zbMath1027.05019OpenAlexW2046483595MaRDI QIDQ5917423

Haidong Wu, Jennifer McNulty

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1999.1949

zbMATH Keywords

non-separating cycles

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (10)

A characterization of graphic matroids using non-separating cocircuits ⋮ The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements ⋮ A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder ⋮ Connected hyperplanes in binary matroids ⋮ Non-separating cocircuits in matroids ⋮ Obstructions to a binary matroid being graphic ⋮ Characterizing 3-connected planar graphs and graphic matroids ⋮ Non-separating cocircuits in binary matroids ⋮ Non-separating cocircuits avoiding some elements ⋮ Nonseparating Cocircuits in Binary Matroids

Cites Work

• Non-separating induced cycles in graphs
• Parallel concepts in graph theory
• Removable circuits in multigraphs
• A new planarity criterion for 3-connected graphs
• Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
• A Combinatorial Decomposition Theory
• Cocircuit coverings and packings for binary matroids
• On removable circuits in graphs and matroids
• Removable Circuits in Binary Matroids
• A Combinatorial Model for Series-Parallel Networks
• How to Draw a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connected hyperplanes in binary matroids