Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphe représentatif des arêtes d'un multigraphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral characterizations and perfection of line graphs / 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 certain polytopes associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable Set Polytopes for a Class of Circulant Graphs / 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: Q4078069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rank facets of the stable set polytope for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable set polyhedra for K//(1,3)free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / 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: Q2715926 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837982 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Line graphs and forbidden induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / 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: A REVISION OF MINTY'S ALGORITHM FOR FINDING A MAXIMUM WEIGHT STABLE SET OF A CLAW-FREE GRAPH / 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: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Lehman's theorems to packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of facet producing graphs for vertex packing polyhedra / rank
 
Normal rank

Latest revision as of 12:08, 6 June 2024

scientific article
Language Label Description Also known as
English
Clique family inequalities for the stable set polytope of quasi-line graphs.
scientific article

    Statements

    Clique family inequalities for the stable set polytope of quasi-line graphs. (English)
    0 references
    0 references
    4 December 2003
    0 references
    Polyhedral combinatorics
    0 references
    Matching polytope
    0 references
    Claw-free graphs
    0 references
    Quasi-line graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers