The following pages link to The strong perfect graph theorem (Q855256):
Displaying 50 items.
- Definability in the substructure ordering of simple graphs (Q259729) (← links)
- On the independence polynomial of the corona of graphs (Q260027) (← links)
- Clique-stable set separation in perfect graphs with no balanced skew-partitions (Q267214) (← links)
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Graphs with induced-saturation number zero (Q276201) (← links)
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
- An extension of Lehman's theorem and ideal set functions (Q298985) (← links)
- Induced cycles in triangle graphs (Q298987) (← links)
- Exploring the concept of perfection in 3-hypergraphs (Q299076) (← links)
- Lift-and-project ranks of the stable set polytope of joined \(a\)-perfect graphs (Q299078) (← links)
- Even pairs in square-free Berge graphs (Q322216) (← links)
- Induced subgraphs of graphs with large chromatic number. I. Odd holes (Q326809) (← links)
- Star chromatic bounds (Q327688) (← links)
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- Simple and three-valued simple minimum coloring games (Q343804) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Characterization and recognition of some opposition and coalition graph classes (Q344867) (← links)
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- Polytopes of minimum positive semidefinite rank (Q377501) (← links)
- Fast recognition of doubled graphs (Q385965) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Parameterized complexity of vertex deletion into perfect graph classes (Q392038) (← links)
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641) (← links)
- Fixed-parameter algorithms for cochromatic number and disjoint rectangle stabbing via iterative localization (Q393084) (← links)
- On a graph of monogenic semigroups (Q395814) (← links)
- On the independence numbers of the cubes of odd cycles (Q396806) (← links)
- Graph classes and Ramsey numbers (Q400493) (← links)
- Finding clubs in graph classes (Q400518) (← links)
- On a conjecture concerning the Petersen graph. II (Q405121) (← links)
- Random threshold digraphs (Q405260) (← links)
- Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs (Q411837) (← links)
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures (Q411838) (← links)
- Three-colourable perfect graphs without even pairs (Q412165) (← links)
- Classes of graphs with small rank decompositions are \(\chi \)-bounded (Q412260) (← links)
- Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences (Q412344) (← links)
- A linear time algorithm for the induced disjoint paths problem in planar graphs (Q414938) (← links)
- Graphs of separability at most 2 (Q415268) (← links)
- Coloring vertices of a graph or finding a Meyniel obstruction (Q418741) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- A new characterization of perfect graphs (Q442410) (← links)
- On graphs with no induced subdivision of \(K_4\) (Q444381) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Substitution and \(\chi\)-boundedness (Q461725) (← links)
- On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes (Q463287) (← links)
- Regular inference as vertex coloring (Q465248) (← links)
- Certifying algorithms (Q465678) (← links)
- Vertex-transitive CIS graphs (Q472401) (← links)
- Practical and efficient split decomposition via graph-labelled trees (Q472485) (← links)
- Excluding cycles with a fixed number of chords (Q476296) (← links)
- Coloring graphs characterized by a forbidden subgraph (Q476308) (← links)
