Construction of matroidal families by partly closed sets

DOI10.1016/0012-365X(82)90027-9zbMath0502.05015OpenAlexW1973391517MaRDI QIDQ1172644

Manfred Walter

Publication date: 1982

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

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

zbMATH Keywords

matroidal family of graphspartly closed sets

Mathematics Subject Classification ID

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

Related Items (1)

A characterization of matroidal families of multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the existence of uncountably many matroidal families
• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• Subgraphs as circuits and bases of matroids
• On matroidal families
• Parallel concepts in graph theory
• On subgraphs as matroid cells
• Matroidal families of finite connected nonhomeomorphic graphs exist
• On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits

This page was built for publication: Construction of matroidal families by partly closed sets