Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (Q3419712): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 12:10, 5 March 2024

scientific article
Language Label Description Also known as
English
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
scientific article

    Statements

    Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 February 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    blockers
    0 references
    generation algorithms
    0 references
    matchable graphs
    0 references