The following pages link to Matching cutsets in graphs (Q5203060):
Displayed 26 items.
- Secure sets and their expansion in cubic graphs (Q403188) (← links)
- 3-consecutive edge coloring of a graph (Q658096) (← 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)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- On stable cutsets in line graphs (Q1400002) (← links)
- On stable cutsets in graphs (Q1582067) (← links)
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- The sandwich problem for decompositions and almost monotone properties (Q1799213) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- Complexity results for two kinds of colored disconnections of graphs (Q2045036) (← links)
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- Extremal graphs having no matching cuts (Q3113291) (← links)
- The complexity of the matching-cut problem for planar graphs and other graph classes (Q3652545) (← links)
- (Q4876853) (← links)
- (Q5009482) (← links)
- The perfect matching cut problem revisited (Q5918785) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)
- The perfect matching cut problem revisited (Q5925551) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)