The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/dm/RousselRT09, #quickstatements; #temporary_batch_1731462974821
 
(2 intermediate revisions by 2 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q55966530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on even pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical properties related to minimal imperfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive generation of partitionable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3222874 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berge trigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / 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: Star-cutsets and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337488 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial designs related to the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bull-free Berge graphs are perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing claw-free perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs, partitionable graphs and cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced \(0,\pm 1\) matrices. II: Recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part I: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part II: Recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Hole Recognition in Graphs of Bounded Clique Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Square-free perfect graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing balancedness and perfection of linear matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable set bonding in perfect graphs and parity graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compositions for perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete multi-partite cutsets in minimal imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / 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: Q4149476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521527 / 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: Anti-blocking polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5341588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal imperfect graphs: A simple approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms on clique separable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circular critical graphs / 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: Q3216686 / 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: Q5749319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of minimal imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the divisibility of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to three conjectures concerning perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even pairs and the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839008 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of 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: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split-neighbourhood graphs and the strong perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs with no \(P_ 5\) and no \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4129482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new property of critical imperfect graphs and some consequences / 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: On recognizing integer 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: The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4484907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: About skew partitions in minimal imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: HOLES AND DOMINOES IN MEYNIEL GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Building counterexamples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758337 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chair-free Berge graphs are perfect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5343396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On critical edges in minimal imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The connectivity of minimal imperfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3621680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-perfect matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3946199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely colorable perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring graphs with stable cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring perfect \((K_ 4\)-e)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686753 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dm/RousselRT09 / rank
 
Normal rank

Latest revision as of 03:04, 13 November 2024

scientific article
Language Label Description Also known as
English
The strong perfect graph conjecture: 40 years of attempts, and its resolution
scientific article

    Statements

    The strong perfect graph conjecture: 40 years of attempts, and its resolution (English)
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    perfect graphs
    0 references
    partitionable graphs
    0 references
    decomposition theorems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers