The following pages link to The strong perfect graph theorem (Q855256):
Displayed 50 items.
- 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)
- 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)
- Transitive orientations in bull-reducible Berge graphs (Q531595) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- On Roussel-Rubio-type lemmas and their consequences (Q533774) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- Injective colorings of graphs with low average degree (Q548659) (← links)
- Boundary properties of graphs for algorithmic graph problems (Q551178) (← links)
- Some new hereditary classes where graph coloring remains NP-hard (Q556851) (← links)
- Rainbow generalizations of Ramsey theory: A survey (Q604649) (← links)
- Associated primes of monomial ideals and odd holes in graphs (Q610455) (← links)
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Some properties of graphs determined by edge zeta functions (Q624533) (← links)
- Well-covered circulant graphs (Q626761) (← links)
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
- Total chromatic number of unichord-free graphs (Q643026) (← links)
- Algorithms for finding an induced cycle in planar graphs (Q653839) (← links)
- Some properties of edge intersection graphs of single-bend paths on a grid (Q658070) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Path-bicolorable graphs (Q659746) (← links)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Maximum weight independent sets in hole- and dart-free graphs (Q714022) (← links)
- An \(O(nm)\)-time certifying algorithm for recognizing HHD-free graphs (Q714793) (← links)
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals (Q716459) (← 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)
- NP-hardness of the recognition of coordinated graphs (Q839773) (← links)