The following pages link to Recognizing decomposable graphs (Q3320412):
Displayed 41 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- Improper C-colorings of graphs (Q629357) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Complexity and kernels for bipartition into degree-bounded induced graphs (Q730002) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← 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)
- Stable skew partition problem (Q1887035) (← links)
- Finding cuts of bounded degree: complexity, FPT and exact algorithms, and kernelization (Q2032346) (← links)
- On the complexity of matching cut for graphs of bounded radius and \(H\)-free graphs (Q2087455) (← links)
- A note on matching-cut in \(P_t\)-free graphs (Q2094374) (← links)
- An FPT algorithm for matching cut and d-cut (Q2115892) (← links)
- Vertex partitioning problems on graphs with bounded tree width (Q2161252) (← links)
- \(\ell_p\)-norm multiway cut (Q2165036) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- Asymptotically almost every \(2r\)-regular graph has an internal partition (Q2303426) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Bisplit graphs (Q2568470) (← links)
- Perfectly matched sets in graphs: parameterized and exact computation (Q2697539) (← links)
- Complexity and Kernels for Bipartition into Degree-bounded Induced Graphs (Q2942649) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← 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)
- (Q5009482) (← links)
- (Q5708527) (← 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)
- Finding perfect matching cuts faster (Q6182915) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)