A characterization of complete matroid base graphs

DOI10.1016/0095-8956(77)90006-5zbMath0352.05022OpenAlexW2064232525MaRDI QIDQ1235706

M. D. Tobey, C. A. Holzmann, J. D. Donald

Publication date: 1977

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90006-5

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99)

Related Items (7)

Determining the minimum rank of matroids whose basis graph is common ⋮ A lower bound on connectivities of matroid base graphs ⋮ Basis graphs of even delta-matroids ⋮ A generalised exchange theorem for matroid bases ⋮ Counting Hamiltonian cycles in the matroid basis graph ⋮ Paths and cycles in matroid base graphs ⋮ On two conjectures of maurer concerning basis graphs of matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Matroid basis graphs. II
• A characterization of tetrahedral graphs
• A characterization of the Tm graph
• Graphs with Maximal Even Girth
• A Graphical Representation of Matroids
• On the Tree Graph of a Matroid

This page was built for publication: A characterization of complete matroid base graphs