Strict matching matroids and matroid algorithms

DOI10.1080/03081088608817718zbMath0606.05017OpenAlexW1978795414WikidataQ126249411 ScholiaQ126249411MaRDI QIDQ3744174

Mark S. Mummy

Publication date: 1986

Published in: Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081088608817718

zbMATH Keywords

Tutte polynomialWhitney polynomialEdmonds decompositionstrict matching matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• A generalization of Tutte's 1-factor theorem to countable graphs
• The Edmonds-Gallai decomposition for matchings in locally finite graphs
• Matchings in graphs. II
• The dependence graph for bases in matroids
• Gammoids and transversal matroids
• The generalized column incidence graph and a matroid base-listing algorithm
• Full transversal matroids, strict gammoids, and the matroid components problem
• A MATROID THEORETIC APPROACH TO THE MATCHING STRUCTURE OF A GRAPH
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
• A CHARACTERIZATION OF STRICT MATCHING MATROIDS
• Paths, Trees, and Flowers

This page was built for publication: Strict matching matroids and matroid algorithms