Pages that link to "Item:Q2259853"
From MaRDI portal
The following pages link to The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853):
Displaying 18 items.
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- Coloring problems on bipartite graphs of small diameter (Q831342) (← links)
- On the parameterized complexity of maximum degree contraction problem (Q832521) (← links)
- Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
- Coherent network partitions (Q2026346) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- A single exponential-time FPT algorithm for cactus contraction (Q2697543) (← links)
- Minimal Disconnected Cuts in Planar Graphs (Q2947884) (← links)
- (Q3304148) (← links)
- (Q5009627) (← links)
- The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)
- Contracting to a longest path in H-free graphs (Q6065420) (← links)
- On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- Constraint satisfaction problem: what makes the problem easy (Q6119674) (← links)
