A characterization of matroidal families of multigraphs

DOI10.1016/0012-365X(84)90107-9zbMath0551.05032OpenAlexW1984912119MaRDI QIDQ801074

Volker Prüß

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90107-9

zbMATH Keywords

submodular functionsmatroidal families

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the existence of uncountably many matroidal families
• Construction of matroidal families by partly closed sets
• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• On matroidal families
• On subgraphs as matroid cells
• Matroidal families of finite connected nonhomeomorphic graphs exist
• BICIRCULAR MATROIDS
• On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits

This page was built for publication: A characterization of matroidal families of multigraphs