The following pages link to The strong perfect graph theorem (Q855256):
Displaying 50 items.
- 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)
- A semi-strong perfect graph theorem (Q1104341) (← links)
- The strong perfect graph conjecture for pan-free graphs (Q1112848) (← links)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets (Q1197003) (← links)
- On Tucker vertices of graphs (Q1301659) (← links)
- Normal fraternally orientable graphs satisfy the strong perfect graph conjecture (Q1313857) (← links)
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\) (Q1334944) (← links)
- Quasi-parity and perfect graphs (Q1349738) (← links)
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- Progress on perfect graphs (Q1403295) (← 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)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- Mock threshold graphs (Q1637131) (← links)
- 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)
