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

From MaRDI portal
Revision as of 12:52, 5 September 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    7 February 2007
    0 references
    blockers
    0 references
    generation algorithms
    0 references
    matchable graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references