The following pages link to (Q4448767):
Displaying 26 items.
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- Algorithms solving the matching cut problem (Q897900) (← links)
- On stable cutsets in claw-free graphs and planar graphs (Q935842) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- On the complexity of finding balanced oneway cuts (Q1014383) (← links)
- Complexity of matching problems (Q1099615) (← links)
- On structural parameterizations of the matching cut problem (Q1708644) (← links)
- A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter (Q1740696) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← 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)
- Perfect matching cuts partitioning a graph into complementary subgraphs (Q2169960) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- Combinatorial complexity of a certain 1-dimensional cutting stock problem (Q2900934) (← links)
- Algorithms Solving the Matching Cut Problem (Q2947027) (← links)
- Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
- (Q5009482) (← links)
- (Q5708527) (← links)
- Matching cut in graphs with large minimum degree (Q5925521) (← links)
- Finding matching cuts in \(H\)-free graphs (Q6046951) (← links)
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs (Q6188517) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)
- Dichotomies for maximum matching cut: \(H\)-freeness, bounded diameter, bounded radius (Q6614030) (← links)
