The perfectly matchable subgraph polytope of a bipartite graph (Q3039039)

From MaRDI portal
Revision as of 10:04, 14 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The perfectly matchable subgraph polytope of a bipartite graph
scientific article

    Statements

    The perfectly matchable subgraph polytope of a bipartite graph (English)
    0 references
    0 references
    0 references
    0 references
    1983
    0 references
    bipartite graph
    0 references
    perfectly matchable subgraph polytope
    0 references
    perfect matching
    0 references
    bus-driver scheduling problem
    0 references
    set covering
    0 references
    Koenig-Hall theorem
    0 references
    projection technique
    0 references
    lattice polyhedra
    0 references
    facets
    0 references
    minimal linear system of inequalities
    0 references

    Identifiers

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