Pages that link to "Item:Q1034603"
From MaRDI portal
The following pages link to Partitioning graphs into connected parts (Q1034603):
Displaying 29 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- Increasing the minimum degree of a graph by contractions (Q385061) (← links)
- Detecting induced minors in AT-free graphs (Q390909) (← links)
- Removing local extrema from imprecise terrains (Q419504) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Partitioning a graph into minimum gap components (Q510915) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- Partitioning multi-edge graphs (Q911315) (← links)
- Partitioning graphs into complete and empty graphs (Q1045126) (← links)
- On the parameterized complexity of 2-partitions (Q2205943) (← links)
- Detecting fixed patterns in chordal graphs in polynomial time (Q2249737) (← links)
- The computational complexity of disconnected cut and \(2 K_2\)-partition (Q2259853) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Increasing the Minimum Degree of a Graph by Contractions (Q2891338) (← links)
- Path Contraction Faster than $2^n$ (Q3300757) (← links)
- Partitioning ℝ<sup><em>n</em></sup> into Connected Components (Q3450379) (← links)
- On partitioning the edges of graphs into connected subgraphs (Q3816108) (← links)
- Finding part-machine families using graph partitioning techniques (Q4230183) (← links)
- Path Contraction Faster Than 2^n (Q5091159) (← links)
- (Q5233771) (← links)
- The Price of Connectivity in Fair Division (Q5864211) (← links)
- Contracting bipartite graphs to paths and cycles (Q5915810) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918405) (← links)
- Disjoint paths and connected subgraphs for \(H\)-free graphs (Q5918624) (← links)
- Connected vertex cover for \((sP_1+P_5)\)-free graphs (Q5919305) (← links)
- Contracting bipartite graphs to paths and cycles (Q5920049) (← links)
- Induced disjoint paths and connected subgraphs for \(H\)-free graphs (Q6053467) (← links)
- Priced gerrymandering (Q6093576) (← links)
