Paths and cycles in matroid base graphs

DOI10.1007/BF01788672zbMath0692.05017OpenAlexW2017949301MaRDI QIDQ583218

Brian Alspach, Gui Zhen Liu

Publication date: 1989

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01788672

zbMATH Keywords

matroidbase graph

Mathematics Subject Classification ID

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

Related Items (12)

Determining the minimum rank of matroids whose basis graph is common ⋮ A lower bound on connectivities of matroid base graphs ⋮ Cycles in circuit graphs of matroids ⋮ Properties of Hamilton cycles of circuit graphs of matroids ⋮ The connectivity and diameter of second order circuit graphs of matroids ⋮ Hamilton cycles in circuit graphs of matroids ⋮ Paths in circuit graphs of matroids ⋮ Counting Hamiltonian cycles in the matroid basis graph ⋮ A note on certain de Bruijn sequences with forbidden subsequences ⋮ The connectivity and minimum degree of circuit graphs of matroids ⋮ Brian Alspach and his work ⋮ Characterizations of matroids with an element lying in a restricted number of circuits

Cites Work

• Pancyclic graphs. II
• A characterization of complete matroid base graphs
• On the Tree Graph of a Matroid

This page was built for publication: Paths and cycles in matroid base graphs