On stable set polyhedra for K//(1,3)free graphs (Q1168982): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical properties related to minimal imperfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5684698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of vertex packing and independence system polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facial structure of set packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect zero–one matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost integral polyhedra related to certain combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of facet producing graphs for vertex packing polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring a Family of Circular Arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critical perfect graphs and perfect 3-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946199 / rank
 
Normal rank

Latest revision as of 15:48, 13 June 2024

scientific article
Language Label Description Also known as
English
On stable set polyhedra for K//(1,3)free graphs
scientific article

    Statements

    On stable set polyhedra for K//(1,3)free graphs (English)
    0 references
    0 references
    0 references
    1981
    0 references
    stable set
    0 references
    facet
    0 references
    strong perfect graph conjecture
    0 references

    Identifiers