Infinite subgraphs as matroid circuits

DOI10.1016/0095-8956(79)90018-2zbMath0433.05018OpenAlexW2089493193MaRDI QIDQ1139051

Laurence R. Matthews

Publication date: 1979

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(79)90018-2

zbMATH Keywords

subgraphsmatroidal familiesmatroid circuits

Mathematics Subject Classification ID

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

Related Items (6)

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs ⋮ Decomposable multi-parameter matroid optimization problems. ⋮ On matroids and hierarchical graphs ⋮ On matroids and hierarchical graphs ⋮ Matroids from directed graphs ⋮ Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

Cites Work

• On matroids on edge sets of graphs with connected subgraphs as circuits. II
• Infinite graphs and bicircular matroids
• On subgraphs as matroid cells
• BICIRCULAR MATROIDS
• A Solution of the Shannon Switching Game
• On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Infinite subgraphs as matroid circuits