Paths in circuit graphs of matroids

DOI10.1016/j.tcs.2008.01.033zbMath1145.05016OpenAlexW2006494521MaRDI QIDQ924155

Ping Li, Gui Zhen Liu

Publication date: 28 May 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.033

zbMATH Keywords

pathmatroidcircuit graph of matroidconnected matroidcritical matroid

Mathematics Subject Classification ID

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

Related Items

Properties of Hamilton cycles of circuit graphs of matroids ⋮ Nowhere-zero 3-flows in matroid base graph ⋮ Characterizations of matroids with an element lying in a restricted number of circuits

Cites Work

• Unnamed Item
• Unnamed Item
• Paths and cycles in matroid base graphs
• A lower bound on connectivities of matroid base graphs
• Pancyclic graphs. II
• Extremal critically connected matroids
• Cycles in circuit graphs of matroids
• Matroid basis graphs. I
• Matroid basis graphs. II
• The connectivity of the basis graph of a branching greedoid