Pages that link to "Item:Q4680731"
From MaRDI portal
The following pages link to Finding<i>H</i>-partitions efficiently (Q4680731):
Displayed 13 items.
- The external constraint 4 nonempty part sandwich problem (Q531610) (← links)
- Parameterizing cut sets in a graph by the number of their components (Q653326) (← links)
- \(2K_{2}\) vertex-set partition into nonempty parts (Q966027) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- On disconnected cuts and separators (Q2275942) (← 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)
- 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)