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

From MaRDI portal
Revision as of 19:51, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
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
    0 references