The following pages link to The strong perfect graph theorem (Q855256):
Displayed 50 items.
- 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)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- Coloring Artemis graphs (Q1019741) (← links)
- Independence polynomials of circulants with an application to music (Q1025487) (← links)
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs (Q1025541) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences (Q1026014) (← links)
- Vertex- and edge-minimal and locally minimal graphs (Q1043552) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs (Q1405122) (← links)
- A class of perfect graphs containing \(P_{6}\) (Q1405124) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs. (Q1427186) (← links)
- A note on chromatic number and induced odd cycles (Q1676794) (← links)
- On box-perfect graphs (Q1682206) (← links)
- On the forbidden induced subgraph probe and sandwich problems (Q1686049) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- Chromatic number and subtrees of graphs (Q1692708) (← links)
- \(2K_2\)-partition of some classes of graphs (Q1759842) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Basic perfect graphs and their extensions (Q1779506) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- Stable skew partition problem (Q1887035) (← links)
- Chordal probe graphs (Q1887057) (← links)
- Small edge sets meeting all triangles of a graph (Q1926043) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Game-perfect digraphs (Q1935960) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← 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)
- Perfectly relating the domination, total domination, and paired domination numbers of a graph (Q2342631) (← links)
- Universally balanced combinatorial optimization games (Q2344942) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs (Q2352049) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Coloring graphs with no even hole \(\geqslant 6\): the triangle-free case (Q2363699) (← links)
- One-three join: a graph operation and its consequences (Q2364085) (← links)