Matchings and Δ-Matroids with Coefficien
✍
Franz Kalhoff; Walter Wenzel
📂
Article
📅
1996
🏛
Elsevier Science
🌐
English
⚖ 274 KB
which may be characterized by some variant of the Greedy algorithm for solving optimization problems. This paper is devoted to the examination of the particular subclass of ⌬-matroids induced by simple graphs. It is shown that these ⌬-matroids are representable over fields of any characteristic and