The following pages link to The strong perfect graph theorem (Q855256):
Displaying 50 items.
- The Hamiltonian properties in \(K_{1,r}\)-free split graphs (Q2124619) (← links)
- Forbidden induced subgraphs for perfectness of claw-free graphs of independence number at least 4 (Q2124634) (← links)
- On coloring a class of claw-free graphs. (Q2132368) (← links)
- On standard quadratic programs with exact and inexact doubly nonnegative relaxations (Q2133420) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- \( \chi \)-diperfect digraphs (Q2144488) (← links)
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
- Some results on Berge's conjecture and begin-end conjecture (Q2145686) (← links)
- 2-divisibility of some odd hole free graphs (Q2155661) (← links)
- On the structure of graphs without claw, \(4K_1\) and co-R (Q2158304) (← links)
- Vertex deletion into bipartite permutation graphs (Q2161007) (← links)
- Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
- On chordal and perfect plane near-triangulations (Q2161233) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- Structural properties of Toeplitz graphs (Q2166273) (← links)
- On the probe problem for \((r, \ell)\)-well-coveredness: algorithms and complexity (Q2172604) (← links)
- The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs (Q2173431) (← links)
- The (theta, wheel)-free graphs. II: Structure theorem (Q2173432) (← links)
- Color-line and proper color-line graphs (Q2174556) (← links)
- Neighborhood covering and independence on \(P_4\)-tidy graphs and tree-cographs (Q2178334) (← links)
- On the complexity of cd-coloring of graphs (Q2181255) (← links)
- On some graph classes related to perfect graphs: a survey (Q2184662) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Independent sets, cliques, and colorings in graphons (Q2189827) (← links)
- The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
- Bounds on regularity of quadratic monomial ideals (Q2194763) (← links)
- A local characterization for perfect plane near-triangulations (Q2201998) (← links)
- Better 3-coloring algorithms: excluding a triangle and a seven vertex path (Q2216431) (← links)
- Integer decomposition property for Cayley sums of order and stable set polytopes (Q2225037) (← links)
- On circular-perfect graphs: a survey (Q2225429) (← links)
- In memoriam: Professor Robin Thomas (1962--2020) (Q2227969) (← links)
- An SDP primal-dual algorithm for approximating the Lovász-theta function (Q2249741) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- Constructions of \(k\)-critical \(P_5\)-free graphs (Q2255047) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- Polynomial time algorithm for min-ranks of graphs with simple tree structures (Q2258079) (← links)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- Obstructions for three-coloring graphs without induced paths on six vertices (Q2284725) (← links)
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded (Q2284734) (← links)
- Graphs without five-vertex path and four-vertex cycle (Q2286127) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- Online coloring a token graph (Q2303438) (← links)
- Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) (← links)
- Hajós and Ore constructions for digraphs (Q2309234) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Erdős-Lovász Tihany conjecture for graphs with forbidden holes (Q2312803) (← links)
- Counting edge-injective homomorphisms and matchings on restricted graph classes (Q2321927) (← links)
