The following pages link to On stable cutsets in graphs (Q1582067):
Displaying 22 items.
- On equistable, split, CIS, and related classes of graphs (Q344829) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- 3-consecutive edge coloring of a graph (Q658096) (← links)
- The complexity of list edge-partitions for simple graphs (Q730267) (← 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)
- Matching cutsets in graphs of diameter 2 (Q955037) (← links)
- On stable cutsets in line graphs (Q1400002) (← 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)
- Stable skew partition problem (Q1887035) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- The sandwich problem for cutsets: clique cutset, \(k\)-star cutset (Q2500527) (← links)
- Bisplit graphs (Q2568470) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- (Q5708521) (← links)
- The polynomial dichotomy for three nonempty part sandwich problems (Q5901068) (← links)
