Maps and \(\Delta\)-matroids (Q2639862): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Greedy algorithm and symmetric matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3490007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representability of \(\bigtriangleup\)-matroids over \(GF(2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3926612 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3737443 / rank
 
Normal rank

Revision as of 13:16, 21 June 2024

scientific article
Language Label Description Also known as
English
Maps and \(\Delta\)-matroids
scientific article

    Statements

    Maps and \(\Delta\)-matroids (English)
    0 references
    0 references
    1989
    0 references
    \(\Delta\)-matroids, recently introduced by the author, are combinatorial structures generalizing matroids. This paper associates a \(\Delta\)- matroid D(\({\mathcal M})\) to any pair \({\mathcal M}\neq (G,S)\) where G is a graph which is 2-cell imbedded in a compact surface S. If S is the sphere, D(\({\mathcal M})\) is the cycle matroid of G.
    0 references
    delta-matroids
    0 references

    Identifiers