Structure analysis of some generalizations of matchings and matroids under algorithmic aspects

MaRDI QIDQ2920759zbMATH OpenFDO

Authors Britta Peis

Publication date 28 September 2014

Full work available at URL http://d-nb.info/98559327X/34

zbMATH Keywords

Delta-matroidsGauss greedoidslattice polyhedrapolymatroids

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Note on maximal split-stable subgraphs
• A characterization of König-Egerváry graphs with extendable vertex covers
• König-Egerváry graphs are non-Edmonds
• König Deletion Sets and Vertex Covers above the Matching Size
• scientific article; zbMATH DE number 795216

Cited in

(4)

• Structural properties of matroid matchings
• Note on maximal split-stable subgraphs
• Forbidden subgraphs and the König-Egerváry property
• Forbidden subgraphs and the Kőnig property

This page was built for publication: Structure analysis of some generalizations of matchings and matroids under algorithmic aspects

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