The following pages link to Star-cutsets and perfect graphs (Q1121289):
Displaying 50 items.
- Chair-free Berge graphs are perfect (Q1376074) (← links)
- On a conjecture about uniquely colorable perfect graphs (Q1377674) (← 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)
- An approach to solving \(A^{k}=J-I\) (Q1414133) (← links)
- Square-free perfect graphs. (Q1426100) (← links)
- Quasi-star-cutsets and some consequences (Q1600840) (← links)
- Algorithms for maximum weight induced paths (Q1603504) (← 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)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- A generalization of Chvátal's star-cutset lemma (Q1813708) (← links)
- Odd cycles and matrices with integrality properties (Q1823869) (← links)
- Decomposition of odd-hole-free graphs by double star cutsets and 2-joins (Q1827853) (← links)
- About skew partitions in minimal imperfect graphs (Q1850559) (← links)
- No odd pairs in minimal imperfect NP\({}_{5}\) graphs. (Q1853069) (← links)
- Stable skew partition problem (Q1887035) (← links)
- Recognizing bull-free perfect graphs (Q1895822) (← links)
- Discs in unbreakable graphs (Q1900520) (← links)
- Powers of distance-hereditary graphs (Q1901030) (← links)
- A new class of perfect Hoàng graphs (Q1901048) (← links)
- On edge perfectness and classes of bipartite graphs (Q1910576) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Perfect \((0,\pm 1)\)-matrices and perfect bidirected graphs (Q1978718) (← links)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- A faster algorithm to recognize even-hole-free graphs (Q2347846) (← links)
- Most unbreakable murky graphs are bull-free (Q2366956) (← links)
- On the density of trigraph homomorphisms (Q2373444) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- Coloring the cliques of line graphs (Q2401798) (← links)
- Forbidden lifts (NP and CSP for combinatorialists) (Q2427542) (← links)
- Extended skew partition problem (Q2433705) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
- Classes of perfect graphs (Q2433714) (← links)
- Decomposing Berge graphs and detecting balanced skew partitions (Q2464161) (← links)
- Skew partitions in perfect graphs (Q2482110) (← links)
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Join colourings of chordal graphs (Q2515589) (← links)
- Two-colourings that decompose perfect graphs (Q2640608) (← links)
- Cutsets in perfect and minimal imperfect graphs (Q2758337) (← links)
- Even-hole-free graphs. I: Decomposition theorem (Q2778281) (← links)
- Skew partition sandwich problem is NP-complete (Q2840508) (← links)
- Defending planar graphs against star-cutsets (Q2851448) (← links)
- Amalgams and χ-Boundedness (Q2958199) (← links)
- Even-hole-free graphs part II: Recognition algorithm (Q3150171) (← links)
- Bull-Reducible Berge Graphs are Perfect (Q3438957) (← links)
- On the structure of self-complementary graphs (Q3439312) (← links)
- 2K2-Partition Problem (Q3439337) (← links)
