The following pages link to The strong perfect graph theorem (Q855256):
Displayed 50 items.
- 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)
- Skew partitions in perfect graphs (Q2482110) (← links)
- On extracting maximum stable sets in perfect graphs using Lovász's theta function (Q2506178) (← links)
- On the existence of \((k,l)\)-kernels in infinite digraphs: a survey (Q2509534) (← links)
- Vertex elimination orderings for hereditary graph classes (Q2514166) (← links)
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
- Perfect circular arc coloring (Q2569164) (← links)
- A combinatorial algorithm for minimum weighted colorings of claw-free perfect graphs (Q2576772) (← links)
- A class of perfectly contractile graphs (Q2581496) (← links)
- Minimally circular-imperfect graphs with a major vertex (Q2581632) (← links)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- Reconfiguration of colorable sets in classes of perfect graphs (Q2632018) (← links)
- Reflexive polytopes arising from partially ordered sets and perfect graphs (Q2633460) (← links)
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q2634675) (← links)
- Perfect graphs for domination games (Q2660136) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- Local 2-separators (Q2673481) (← links)
- Neighborhood complexes, homotopy test graphs and an application to coloring of product graphs (Q2673495) (← links)
- Decomposing and colouring some locally semicomplete digraphs (Q2674564) (← links)
- Defective Ramsey numbers and defective cocolorings in some subclasses of perfect graphs (Q2689127) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- On the probe problem for \((r,\ell )\)-well-coveredness (Q2695302) (← links)
- Lovász-Schrijver PSD-operator and the stable set polytope of claw-free graphs (Q2696616) (← links)
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
- The Turán number of directed paths and oriented cycles (Q2701405) (← links)
- Bounding Clique-Width via Perfect Graphs (Q2799217) (← links)
- Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540) (← links)
- Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time (Q2804992) (← links)
- Open Problems on Graph Coloring for Special Graph Classes (Q2827799) (← links)
- Efficient Domination for Some Subclasses of $$P_6$$ -free Graphs in Polynomial Time (Q2827803) (← links)
- Reducing the Clique and Chromatic Number via Edge Contractions and Vertex Deletions (Q2835660) (← links)
- Lovász-Schrijver PSD-Operator on Claw-Free Graphs (Q2835662) (← links)
- Monomial Cut Ideals (Q2839087) (← links)
- Skew partition sandwich problem is NP-complete (Q2840508) (← links)
- On the polynomial time computability of the circular-chromatic number for some superclasses of perfect graphs (Q2840514) (← links)
- Characterising claw-free t-perfect graphs (Q2851509) (← links)
- The Structure of Bull-Free Perfect Graphs (Q2852609) (← links)
- (Q2861542) (← links)
- The Erdös-Hajnal Conjecture-A Survey (Q2874098) (← links)
- Excluding Induced Subdivisions of the Bull and Related Graphs (Q2911052) (← links)
- A Characterization of b-Perfect Graphs (Q2911056) (← links)
- The A4-structure of a graph (Q2911060) (← links)
- Perfect Graphs of Fixed Density: Counting and Homogeneous Sets (Q2911067) (← links)
- Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement (Q2911494) (← links)