The following pages link to The strong perfect graph theorem (Q855256):
Displayed 50 items.
- 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)
- Some remarks on Hajós' conjecture (Q707025) (← links)
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) (← links)
- Colorings of hypergraphs, perfect graphs, and associated primes of powers of monomial ideals (Q716459) (← 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)
- 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)