Pages that link to "Item:Q378212"

The following pages link to Algorithms for partition of some class of graphs under compaction and vertex-compaction (Q378212):

Displaying 8 items.

• Surjective \(H\)-colouring: new hardness results (Q2011662) (← links)
• Disconnected cuts in claw-free graphs (Q2186821) (← links)
• The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
• (Q3304148) (← links)
• The Complexity of Boolean Surjective General-Valued CSPs (Q5111218) (← links)
• Computational Complexity of Graph Partition under Vertex-Compaction to an Irreflexive Hexagon (Q5111286) (← links)
• The Complexity of Counting Surjective Homomorphisms and Compactions (Q5232140) (← links)
• Computational complexity relationship between compaction, vertex-compaction, and retraction (Q5915913) (← links)