The following pages link to Fast Skew Partition Recognition (Q5302744):
Displaying 13 items.
- Colouring perfect graphs with bounded clique number (Q345123) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← 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)
- The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem (Q2255038) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- On the linear extension complexity of stable set polytopes for perfect graphs (Q2311370) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Skew partition sandwich problem is NP-complete (Q2840508) (← links)
- Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← links)
