The following pages link to The strong perfect graph theorem (Q855256):
Displayed 50 items.
- Reverse lexicographic squarefree initial ideals and Gorenstein Fano polytopes (Q1657978) (← links)
- The weighted coloring problem for two graph classes characterized by small forbidden induced structures (Q1671374) (← 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)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- The normal graph conjecture for two classes of sparse graphs (Q1706428) (← links)
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- Maximum weight stable set in (\(P_7\), bull)-free graphs and (\(S_{1, 2, 3}\), bull)-free graphs (Q1709548) (← links)
- Characterization of forbidden subgraphs for bounded star chromatic number (Q1712503) (← links)
- A note on chromatic number of (cap, even hole)-free graphs (Q1712540) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- Critical \((P_6, \mathrm{banner})\)-free graphs (Q1732108) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Sum-perfect graphs (Q1735702) (← links)
- Reflexive polytopes arising from perfect graphs (Q1747768) (← links)
- Even pairs and prism corners in square-free Berge graphs (Q1748264) (← links)
- Polyhedral studies of vertex coloring problems: the standard formulation (Q1751160) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Finding balance: split graphs and related classes (Q1753048) (← links)
- Extremal colorings and independent sets (Q1756103) (← 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)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
- Contraction and deletion blockers for perfect graphs and \(H\)-free graphs (Q1784743) (← links)
- Polyhedral results on the stable set problem in graphs containing even or odd pairs (Q1785209) (← links)
- On a connection between facility location and perfect graphs (Q1785286) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← 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)
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
- Erdős-Hajnal for cap-free graphs (Q1984528) (← links)
- On forbidden induced subgraphs for \(K_{1, 3}\)-free perfect graphs (Q1999727) (← links)
- Critical kernel imperfect problem in generalizations of bipartite tournaments (Q2000560) (← links)
- Small 1-defective Ramsey numbers in perfect graphs (Q2010929) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs (Q2029946) (← links)
- Independent sets and hitting sets of bicolored rectangular families (Q2032357) (← links)
- Some indices over a new algebraic graph (Q2035661) (← links)
- Forbidden subgraphs of power graphs (Q2040001) (← links)
- On the commuting graph of semidihedral group (Q2049019) (← links)