Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1738420676 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.2730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crossing patterns of semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique versus independent set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Hajnal conjecture for paths and antipaths / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs of arbitrarily large clique-chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berge trigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs I -- three-edge-paths with centers and anticenters / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of bull-free graphs II and III -- a summary / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdös-Hajnal Conjecture-A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs. V. Global structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring perfect graphs with no balanced skew-partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bipartite analogue of Dilworth's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509401 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable sets and polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Berge graphs and detecting balanced skew partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2822594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear vs. semidefinite extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank

Latest revision as of 18:58, 11 July 2024

scientific article
Language Label Description Also known as
English
Clique-stable set separation in perfect graphs with no balanced skew-partitions
scientific article

    Statements

    Clique-stable set separation in perfect graphs with no balanced skew-partitions (English)
    0 references
    0 references
    0 references
    8 April 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    clique-stable set separation
    0 references
    perfect graph
    0 references
    trigraph
    0 references
    2-join
    0 references
    0 references
    0 references