The strong perfect-graph conjecture is true for K₁,3-free graphs
From MaRDI portal
Publication:1213881
Cites work
Cited in
(57)- The optimal cost chromatic partition problem for trees and interval graphs
- Clique-perfectness and balancedness of some graph classes
- scientific article; zbMATH DE number 2230322 (Why is no real title available?)
- On coloring a class of claw-free graphs.
- The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs
- Critical perfect graphs and perfect 3-chromatic graphs
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture
- A description of claw-free perfect graphs
- New classes of Berge perfect graphs
- Completeness for intersection classes
- An algorithm for colouring perfect planar graphs
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
- Perfectness of normal products of graphs
- Gallai graphs and anti-Gallai graphs
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
- The strong perfect graph conjecture: 40 years of attempts, and its resolution
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Square-free perfect graphs.
- Claw-free graphs---a survey
- An approach to solving \(A^{k}=J-I\)
- Extending matchings in claw-free graphs
- The strong perfect graph conjecture for pan-free graphs
- Perfect product graphs
- Two classes of perfect graphs
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- Generalized perfect graphs: Characterizations and inversion
- Claw-free circular-perfect graphs
- Clique-perfectness of complements of line graphs
- Claw-free graphs, skeletal graphs, and a stronger conjecture on \(\omega\), \(\Delta\), and \(\chi\)
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- Clique family inequalities for the stable set polytope of quasi-line graphs.
- The cyclic compact open-shop scheduling problem
- Even pairs in claw-free perfect graphs
- Recognizing claw-free perfect graphs
- Some properties of minimal imperfect graphs
- On the strong perfect graph conjecture and critical graphs
- On the structure of graphs without claw, \(4K_1\) and co-R
- Short-chorded and perfect graphs
- Alternating orientation and alternating colouration of perfect graphs
- Graphical properties related to minimal imperfection
- A classification of certain graphs with minimal imperfection properties
- On the choosability of claw-free perfect graphs
- The edge intersection graphs of paths in a tree
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs
- On minimally circular-imperfect graphs
- Wings and perfect graphs
- A coloring algorithm for \(4 K_1\)-free line graphs
- On stable set polyhedra for K//(1,3)free graphs
- Classes of perfect graphs
- The structure of claw-free perfect graphs
- A transformation which preserves the clique number
- Path parity and perfection
- Line perfect graphs
- Chair-free Berge graphs are perfect
- On coloring a class of claw-free and hole-twin-free graphs
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
This page was built for publication: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1213881)
