The following pages link to The strong perfect graph theorem (Q855256):
Displaying 50 items.
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- On forbidden induced subgraphs for unit disk graphs (Q724944) (← links)
- The price of connectivity for cycle transversals (Q739064) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- Automated generation of conjectures on forbidden subgraph characterization (Q741737) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Maximum weight independent sets in hole- and co-chair-free graphs (Q763494) (← links)
- Split digraphs (Q764900) (← links)
- Combinatorial optimization with 2-joins (Q765197) (← links)
- The structure of bull-free graphs I -- three-edge-paths with centers and anticenters (Q765202) (← links)
- On algorithms for (\(P_5\), gem)-free graphs (Q817767) (← links)
- Independent domination in hereditary classes (Q818132) (← links)
- Chordless paths through three vertices (Q820149) (← links)
- On cd-coloring of trees and co-bipartite graphs (Q831718) (← links)
- NP-hardness of the recognition of coordinated graphs (Q839773) (← links)
- 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)
- Decomposing Berge graphs containing no proper wheel, long prism or their complements (Q879162) (← 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)
