\(b\)-matching degree-sequence polyhedra (Q1180424): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The perfectly matchable subgraph polytope of an arbitrary graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm and symmetric matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and \(\Delta\)-matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudomatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of discriminants in metric vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for solving a certain class of linear programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On totally dual integral systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extreme degree sequences of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On T-joins and odd factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polytope of degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed submodularity, ditroids and directed submodular flows / rank
 
Normal rank

Revision as of 13:01, 15 May 2024

scientific article
Language Label Description Also known as
English
\(b\)-matching degree-sequence polyhedra
scientific article

    Statements

    \(b\)-matching degree-sequence polyhedra (English)
    0 references
    0 references
    0 references
    27 June 1992
    0 references
    \(b\)-matching
    0 references
    polyhedra
    0 references
    convex hull
    0 references
    degree sequences
    0 references
    min-max separation theorem
    0 references
    submodular functions
    0 references

    Identifiers