Paths and cycles in matroid base graphs
From MaRDI portal
Publication:583218
DOI10.1007/BF01788672zbMath0692.05017MaRDI QIDQ583218
Publication date: 1989
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Related Items
Determining the minimum rank of matroids whose basis graph is common, The connectivity and minimum degree of circuit graphs of matroids, Properties of Hamilton cycles of circuit graphs of matroids, Paths in circuit graphs of matroids, A note on certain de Bruijn sequences with forbidden subsequences, A lower bound on connectivities of matroid base graphs, The connectivity and diameter of second order circuit graphs of matroids, Cycles in circuit graphs of matroids, Hamilton cycles in circuit graphs of matroids, Brian Alspach and his work
Cites Work