On claw-free \(t\)-perfect graphs (Q431021): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Compositions of Graphs and Polyhedra II: Stable Sets / rank
 
Normal rank
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: Polyhedral characterizations and perfection of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring quasi-line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / 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: Q5315023 / 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: The stable set polytope of quasi-line graphs / 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: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-blocking polyhedra / 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: Q3999620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graphs with All Subgraphs T-Perfect / 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: Relaxations of vertex packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Triangle Case of the Acquaintance Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405192 / 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: Q4078069 / 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: A class of h-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Lehman's theorems to packing problems / rank
 
Normal rank

Latest revision as of 10:24, 5 July 2024

scientific article
Language Label Description Also known as
English
On claw-free \(t\)-perfect graphs
scientific article

    Statements

    On claw-free \(t\)-perfect graphs (English)
    0 references
    0 references
    0 references
    26 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    3-colourable graphs
    0 references
    chromatic number of claw-free \(h\)-perfect graphs
    0 references
    polynomial-time algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references