Pages that link to "Item:Q650911"
From MaRDI portal
The following pages link to On partitioning a graph into two connected subgraphs (Q650911):
Displaying 13 items.
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Partitioning graphs into connected parts (Q1034603) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Graphs without a partition into two proportionally dense subgraphs (Q2281161) (← links)
- Partitioning a graph into two pieces, each isomorphic to the other or to its complement (Q2576840) (← links)
- On partitioning the edges of graphs into connected subgraphs (Q3816108) (← links)
- (Q5233771) (← links)
- ON TWO GRAPH PARTITIONING QUESTIONS (Q5694371) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)
- Partitioning a graph into complementary subgraphs (Q5918340) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)