Pages that link to "Item:Q4680731"

The following pages link to Finding<i>H</i>-partitions efficiently (Q4680731):

Displaying 22 items.

• Obstructions to partitions of chordal graphs (Q383740) (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
• The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
• Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
• Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
• \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
• Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
• \(2K_2\)-partition of some classes of graphs (Q1759842) (← links)
• The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
• Disconnected cuts in claw-free graphs (Q2186821) (← links)
• The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
• On disconnected cuts and separators (Q2275942) (← links)
• Graph partitions with prescribed patterns (Q2509761) (← links)
• Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees (Q3007632) (← links)
• On the structure of self-complementary graphs (Q3439312) (← links)
• 2K2-Partition Problem (Q3439337) (← links)
• Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
• 2K2 vertex-set partition into nonempty parts (Q3503567) (← links)
• (Q5009627) (← links)
• Covering Graphs with Few Complete Bipartite Subgraphs (Q5458846) (← links)
• The polynomial dichotomy for three nonempty part sandwich problems (Q5900084) (← links)
• The polynomial dichotomy for three nonempty part sandwich problems (Q5901068) (← links)