Chords and disjoint paths in matroids

DOI10.1016/0012-365X(77)90115-7zbMath0366.05021MaRDI QIDQ1241753

William H. Cunningham

Publication date: 1977

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

Mathematics Subject Classification ID

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

Related Items (6)

On binary reducibility ⋮ On the sum of matroids. III ⋮ Separating cocircuits in binary matroids ⋮ The Tutte polynomial of a ported matroid ⋮ Cycle bases for lattices of binary matroids with no Fano dual minor and their one-element extensions ⋮ A particular class of graphic matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The matroids with the max-flow min-cut property
• \(l\)-matrices and a characterization of binary matroids
• The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
• On the sum of matroids
• A Solution of the Shannon Switching Game
• Connectivity in Matroids
• Lectures on matroids

This page was built for publication: Chords and disjoint paths in matroids