The following pages link to (Q4393307):
Displaying 18 items.
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- 3-consecutive edge coloring of a graph (Q658096) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- A new characterization of unichord-free graphs (Q891324) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- On stable cutsets in line graphs (Q1400002) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Stable skew partition problem (Q1887035) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← 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)
- Bisplit graphs (Q2568470) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- (Q5708521) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5901068) (← links)
