The following pages link to The strong perfect graph theorem (Q855256):
Displayed 50 items.
- On the structure of certain intersection graphs (Q845675) (← links)
- On independent vertex sets in subclasses of apple-free graphs (Q848838) (← links)
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- A bipartite analogue of Dilworth's theorem (Q862983) (← links)
- Triangulated neighborhoods in even-hole-free graphs (Q870966) (← links)
- MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481) (← links)
- Fair cost allocations under conflicts - a game-theoretic point of view - (Q924627) (← links)
- The complexity of recognizing linear systems with certain integrality properties (Q927158) (← links)
- On minimally circular-imperfect graphs (Q932581) (← links)
- Problems and results in extremal combinatorics. II (Q941386) (← links)
- Claw-free graphs. IV: Decomposition theorem (Q947722) (← links)
- Solving some NP-complete problems using split decomposition (Q948695) (← links)
- The Erdős-Hajnal conjecture for bull-free graphs (Q958690) (← links)
- \(K_{4}\)-free graphs with no odd holes (Q965257) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- Induced disjoint paths problem in a planar digraph (Q967379) (← links)
- On cover-structure graphs (Q967385) (← links)
- A note on kernels and Sperner's Lemma (Q967389) (← links)
- A polyhedral approach to the stability of a family of coalitions (Q968155) (← links)
- A magnetic procedure for the stability number (Q968215) (← links)
- Finding a maximum-weight induced \(k\)-partite subgraph of an \(i\)-triangulated graph (Q972337) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- Precoloring extension of co-Meyniel graphs (Q995757) (← links)
- On \(P_4\)-transversals of chordal graphs (Q998435) (← links)
- The stable set polytope for some extensions of \(P_4\)-free graphs (Q998505) (← links)
- The \(\langle t \rangle \)-property of some classes of graphs (Q998518) (← links)
- Constructions for normal graphs and some consequences (Q1003480) (← links)
- Even pairs in Berge graphs (Q1003839) (← links)
- On the inapproximability of independent domination in \(2P_3\)-free perfect graphs (Q1006083) (← links)
- Duality for semiantichains and unichain coverings in products of special posets (Q1013994) (← links)
- Game-perfect graphs (Q1014302) (← links)
- Partial characterizations of coordinated graphs: Line graphs and complements of forests (Q1014303) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- Independence polynomials of circulants with an application to music (Q1025487) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- A class of perfect graphs containing \(P_{6}\) (Q1405124) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- Mock threshold graphs (Q1637131) (← links)