On a matroid generalization of graph connectivity

DOI10.1017/S0305004100058667MaRDI QIDQ3927265zbMATH OpenFDO

Authors James Oxley

Publication date 1981

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0305004100058667

zbMATH Keywords

n-connected graphn-connected matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Cites work

• Connectivity in Matroids
• Extremal critically connected matroids
• Graph theory with applications
• scientific article; zbMATH DE number 3572162 (Why is no real title available?)
• Matroid representation over GF(3)
• Packing and covering with matroid circuits
• Theorems on matroid connectivity

Cited in

(9)

• On 3-connected matroids
• On contractible and vertically contractible elements in 3-connected matroids and graphs
• Matroids with many common bases.
• Fork-decompositions of matroids
• Matroids with few non-common bases
• On the parameterized complexity of \textsc{Girth} and \textsc{Connectivity} problems on linear matroids
• On Random Representable Matroids
• Some Local Extremal Connectivity Results for Matroids
• On matroid connectivity

This page was built for publication: On a matroid generalization of graph connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3927265)