The following pages link to The strong perfect graph theorem (Q855256):
Displaying 50 items.
- Structure of cubic Lehman matrices (Q2325755) (← 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)
- The story of perfectly orderable graphs (Q2373439) (← links)
- On the density of trigraph homomorphisms (Q2373444) (← links)
- Detecting 2-joins faster (Q2376790) (← links)
- Characterizations of \((4 K_1,C_4,C_5)\)-free graphs (Q2403803) (← links)
- 4-coloring \((P_6, \text{bull})\)-free graphs (Q2403807) (← links)
- On bounding the difference between the maximum degree and the chromatic number by a constant (Q2403810) (← links)
- 3-colouring for dually chordal graphs and generalisations (Q2404614) (← links)
- The Hadwiger number, chordal graphs and \(ab\)-perfection (Q2409752) (← links)
- Forbidden induced subgraphs (Q2413330) (← links)
- Triangle packings and transversals of some \(K_{4}\)-free graphs (Q2413632) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- On \(r\)-hued colorings of graphs without short induced paths (Q2421855) (← links)
- Bounding clique-width via perfect graphs (Q2424685) (← 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)
- Forbidden graphs for classes of split-like graphs (Q2441949) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
- Boundary graph classes for some maximum induced subgraph problems (Q2444152) (← links)
- Forbidden subgraphs and the König-Egerváry property (Q2444529) (← links)
- Finding a smallest odd hole in a claw-free graph using global structure (Q2444540) (← links)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- The linear guessing number of undirected graphs (Q2447965) (← 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)
- On the complexity of 4-coloring graphs without long induced paths (Q2465649) (← links)
- Combinatorial symbolic powers (Q2470395) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs (Q2482103) (← links)
