Adjacency in binary matroids

DOI10.1016/S0195-6698(86)80043-9MaRDI QIDQ1093647zbMATH OpenFDO

Authors Paul Seymour

Publication date 1986

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

zbMATH Keywords

disjoint pathsgraphic matroidbinary matroidcographic matroid

Mathematics Subject Classification ID

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

Recommendations

• Adjoints of binary matroids
• The adjacency matroid of a graph
• Matroids with every two elements in a 4-circuit.
• Adjacency, inseparability, and base orderability in matroids
• scientific article; zbMATH DE number 4089605

Cites work

• scientific article; zbMATH DE number 3133252 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• Decomposition of regular matroids
• Disjoint paths in graphs
• Minors of 3-connected matroids
• Modular Constructions for Combinatorial Geometries

Cited in

(26)

• Adjacency Matrices
• Adjoints of binary matroids
• The smallest rounded sets of binary matroids
• The adjacency matroid of a graph
• Matroids with every two elements in a 4-circuit.
• scientific article; zbMATH DE number 4053687 (Why is no real title available?)
• scientific article; zbMATH DE number 1003264 (Why is no real title available?)
• Connected hyperplanes in binary matroids
• On matroid intersection adjacency
• Finding a small 3-connected minor maintaining a fixed minor and a fixed element
• THE LONG-LINE GRAPH OF A COMBINATORIAL GEOMETRY. I. EXCLUDING M(K₄) AND THE (q + 2)-POINT LINE AS MINORS
• Triples in matroid circuits
• Rooted prism-minors and disjoint cycles containing a specified edge
• Obstructions for the Disk and the Cylinder Embedding Extension Problems
• scientific article; zbMATH DE number 4089605 (Why is no real title available?)
• An approach to the subgraph homeomorphism problem
• On fixing edges in graph minors
• A generalization of chordal graphs
• Ordering circuits of matroids
• On minors avoiding elements in matroids
• Adjacency, inseparability, and base orderability in matroids
• Minors of 3-connected matroids
• Graph minors. IX: Disjoint crossed paths
• A binary-matroid analogue of a graph connectivity theorem of Jamison and Mulder
• A characterization of certain excluded-minor classes of matroids
• Triangles in 3-connected matroids

This page was built for publication: Adjacency in binary matroids

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