Adjacency in binary matroids

DOI10.1016/S0195-6698(86)80043-9zbMath0629.05025MaRDI QIDQ1093647

P. D. Seymour

Publication date: 1986

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

binary matroidgraphic matroiddisjoint pathscographic matroid

Mathematics Subject Classification ID

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

Related Items (15)

Minors of 3-connected matroids ⋮ Triples in matroid circuits ⋮ Finding a small 3-connected minor maintaining a fixed minor and a fixed element ⋮ On fixing edges in graph minors ⋮ Obstructions for the Disk and the Cylinder Embedding Extension Problems ⋮ Rooted prism-minors and disjoint cycles containing a specified edge ⋮ Triangles in 3-connected matroids ⋮ On minors avoiding elements in matroids ⋮ A generalization of chordal graphs ⋮ A characterization of certain excluded-minor classes of matroids ⋮ The smallest rounded sets of binary matroids ⋮ Graph minors. IX: Disjoint crossed paths ⋮ Adjacency, inseparability, and base orderability in matroids ⋮ An approach to the subgraph homeomorphism problem ⋮ Ordering circuits of matroids

Cites Work

• Minors of 3-connected matroids
• Decomposition of regular matroids
• Disjoint paths in graphs
• Modular Constructions for Combinatorial Geometries
• Unnamed Item
• Unnamed Item

This page was built for publication: Adjacency in binary matroids