Adjacency, inseparability, and base orderability in matroids

DOI10.1006/eujc.1999.0355zbMath0949.05014OpenAlexW2171463055MaRDI QIDQ1568785

J. C. M. Keijsper, Rudi A. Pendavingh, Alexander Schrijver

Publication date: 28 August 2000

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

Full work available at URL: https://ir.cwi.nl/pub/10079

zbMATH Keywords

oriented matroidmatroidadjacent elementsbase orderable subsetsinseparable elementsstrongly base orderable subsets

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40) Oriented matroids in discrete geometry (52C40)

Related Items (1)

Partitioning bispanning graphs into spanning trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On sign-invariance graphs of uniform oriented matroids
• Inseparability graphs of oriented matroids
• A characterization of the ternary matroids with no \(M(K_ 4)\)-minor
• Minors of 3-connected matroids
• Triples in matroid circuits
• Adjacency in binary matroids
• Orientability of matroids
• Note on inseparability graphs of matroids having exactly one class of orientations
• An algorithm for packing connectors
• Concept of a vertex in a matroid and 3-connected graphs
• On Nonbinary 3-Connected Matroids
• Disjoint Common Transversals and Exchange Structures
• Comments on bases in dependence structures

This page was built for publication: Adjacency, inseparability, and base orderability in matroids