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)
- \(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)
- On the complexity of finding chordless paths in bipartite graphs and some interval operators in graphs and hypergraphs (Q2268880) (← links)
- The story of perfectly orderable graphs (Q2373439) (← links)
- On the density of trigraph homomorphisms (Q2373444) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Line-graphs of cubic graphs are normal (Q2427494) (← links)
- Forbidden lifts (NP and CSP for combinatorialists) (Q2427542) (← links)
- On tension-continuous mappings (Q2427549) (← links)
- Minimal circular-imperfect graphs of large clique number and large independence number (Q2427550) (← links)
- Finding induced paths of given parity in claw-free graphs (Q2428656) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- Alternatives for testing total dual integrality (Q2429472) (← links)
- Extended skew partition problem (Q2433705) (← links)
- Berge's conjecture on directed path partitions -- a survey (Q2433711) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Grinstead's conjecture is true for graphs with a small clique number (Q2433715) (← links)
- A Berge-keeping operation for graphs (Q2433716) (← links)
- Solution of three problems of Cornuéjols (Q2464157) (← links)
- Decomposing Berge graphs and detecting balanced skew partitions (Q2464161) (← links)
- NP-hard graph problems and boundary classes of graphs (Q2465640) (← links)
- On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem (Q2465646) (← links)