The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
From MaRDI portal
Publication:1213881
DOI10.1016/S0095-8956(76)80005-6zbMath0297.05109MaRDI QIDQ1213881
K. R. Parthasarathy, G. Ravindra
Publication date: 1976
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items (56)
New classes of Berge perfect graphs ⋮ Perfect graphs with no \(P_ 5\) and no \(K_ 5\) ⋮ On coloring a class of claw-free graphs. ⋮ Alternating orientation and alternating colouration of perfect graphs ⋮ Generalized perfect graphs: Characterizations and inversion ⋮ Claw-free graphs---a survey ⋮ Path parity and perfection ⋮ On the structure of graphs without claw, \(4K_1\) and co-R ⋮ Two classes of perfect graphs ⋮ The strong perfect graph conjecture for pan-free graphs ⋮ Wings and perfect graphs ⋮ Clique-perfectness and balancedness of some graph classes ⋮ Recognizing claw-free perfect graphs ⋮ Chair-free Berge graphs are perfect ⋮ Gallai graphs and anti-Gallai graphs ⋮ Some properties of minimal imperfect graphs ⋮ Even pairs in claw-free perfect graphs ⋮ Graphical properties related to minimal imperfection ⋮ A coloring algorithm for \(4 K_1\)-free line graphs ⋮ Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé ⋮ Classes of perfect graphs ⋮ An approach to solving \(A^{k}=J-I\) ⋮ Clique family inequalities for the stable set polytope of quasi-line graphs. ⋮ Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs ⋮ A classification of certain graphs with minimal imperfection properties ⋮ On the strong perfect graph conjecture and critical graphs ⋮ Square-free perfect graphs. ⋮ On stable set polyhedra for K//(1,3)free graphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Short-chorded and perfect graphs ⋮ On minimally circular-imperfect graphs ⋮ On the choosability of claw-free perfect graphs ⋮ Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets ⋮ The cyclic compact open-shop scheduling problem ⋮ The Structure of Claw‐Free Perfect Graphs ⋮ The strong perfect graph conjecture holds for diamonded odd cycle-free graphs ⋮ Line perfect graphs ⋮ Perfect product graphs ⋮ Critical perfect graphs and perfect 3-chromatic graphs ⋮ Perfectness of normal products of graphs ⋮ Clique-perfectness of complements of line graphs ⋮ Claw-free circular-perfect graphs ⋮ The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs ⋮ Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ ⋮ Unnamed Item ⋮ An algorithm for colouring perfect planar graphs ⋮ Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ Completeness for intersection classes ⋮ On coloring a class of claw-free and hole-twin-free graphs ⋮ The edge intersection graphs of paths in a tree ⋮ A transformation which preserves the clique number ⋮ A description of claw-free perfect graphs ⋮ Normal fraternally orientable graphs satisfy the strong perfect graph conjecture ⋮ Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets ⋮ Extending matchings in claw-free graphs
Cites Work
This page was built for publication: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
