Ordering of the elements of a matroid such that its consecutive w elements are independent

DOI10.1016/0012-365X(88)90209-9zbMath0657.05018OpenAlexW2026319235MaRDI QIDQ1110522

Yoji Kajitani, Hiroshi Miyano, Shuichi Ueno

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0012-365x(88)90209-9

zbMATH Keywords

orderings on a matroidwith L-ind orderingwth C-ind ordering

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (11)

Equicovering matroids by distinct bases ⋮ On Serial Symmetric Exchanges of Matroid Bases ⋮ Cyclic orderings and cyclic arboricity of matroids ⋮ Weighted exchange distance of basis pairs ⋮ Partitioning into common independent sets via relaxing strongly base orderability ⋮ Cyclically orderable generalized Petersen graphs ⋮ Exchange Distance of Basis Pairs in Split Matroids ⋮ On a base exchange game on bispanning graphs ⋮ Bases-cobases graphs and polytopes of matroids ⋮ On Sequential Basis Exchange in Matroids ⋮ Transforming a graph into a 1-balanced graph

Cites Work

• Minimum partition of a matroid into independent subsets
• Unnamed Item
• Unnamed Item

This page was built for publication: Ordering of the elements of a matroid such that its consecutive w elements are independent