Pages that link to "Item:Q1213881"
From MaRDI portal
The following pages link to The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs (Q1213881):
Displaying 50 items.
- On the choosability of claw-free perfect graphs (Q503632) (← links)
- The cyclic compact open-shop scheduling problem (Q686491) (← links)
- The validity of the strong perfect-graph conjecture for \((K_4-e)\)-free graphs (Q754232) (← links)
- The edge intersection graphs of paths in a tree (Q792348) (← links)
- On minimally circular-imperfect graphs (Q932581) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Alternating orientation and alternating colouration of perfect graphs (Q1089007) (← links)
- Two classes of perfect graphs (Q1112847) (← links)
- The strong perfect graph conjecture for pan-free graphs (Q1112848) (← links)
- Wings and perfect graphs (Q1112849) (← links)
- Recognizing claw-free perfect graphs (Q1118619) (← links)
- Gallai graphs and anti-Gallai graphs (Q1126196) (← links)
- Some properties of minimal imperfect graphs (Q1126292) (← links)
- Even pairs in claw-free perfect graphs (Q1127877) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé (Q1144589) (← links)
- Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs (Q1158444) (← links)
- A classification of certain graphs with minimal imperfection properties (Q1160632) (← links)
- On the strong perfect graph conjecture and critical graphs (Q1165250) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- Short-chorded and perfect graphs (Q1174781) (← links)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs (Q1208345) (← links)
- Perfect product graphs (Q1243282) (← links)
- Critical perfect graphs and perfect 3-chromatic graphs (Q1245851) (← links)
- Perfectness of normal products of graphs (Q1254335) (← links)
- A description of claw-free perfect graphs (Q1306428) (← links)
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (Q1313857) (← links)
- Extending matchings in claw-free graphs (Q1322284) (← links)
- New classes of Berge perfect graphs (Q1332433) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- Claw-free graphs---a survey (Q1356695) (← links)
- Path parity and perfection (Q1356748) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Completeness for intersection classes (Q1584399) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- An algorithm for colouring perfect planar graphs (Q1825203) (← links)
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture (Q1837210) (← links)
- A transformation which preserves the clique number (Q1850572) (← links)
- Generalized perfect graphs: Characterizations and inversion (Q1894378) (← links)
- On coloring a class of claw-free and hole-twin-free graphs (Q2091797) (← links)
- On coloring a class of claw-free graphs. (Q2132368) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Structural results on circular-arc graphs and circle graphs: a survey and the main open problems (Q2448877) (← links)
- Clique-perfectness and balancedness of some graph classes (Q2931952) (← links)
