A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polytope des independants d'un graphe série-parallèle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar 3DM is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformations which Preserve Perfectness and H-Perfectness of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-Minimum Sätze über Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3270978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An orientation theorem for graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices with the Edmonds-Johnson property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of max flow—min cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4754965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stable set polytope of a series-parallel graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3908745 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of h-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total dual integrality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial minimum cost circulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on matroids / rank
 
Normal rank

Latest revision as of 11:14, 20 June 2024

scientific article
Language Label Description Also known as
English
A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
scientific article

    Statements

    A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (English)
    0 references
    0 references
    1989
    0 references
    min-max relations
    0 references
    stable sets
    0 references
    node-covers
    0 references
    bipartite graphs
    0 references

    Identifiers