Pages that link to "Item:Q2352361"
From MaRDI portal
The following pages link to On the complexity of partitioning a graph into a few connected subgraphs (Q2352361):
Displaying 14 items.
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- On the complexity of partitioning graphs into connected subgraphs (Q1057062) (← links)
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs (Q2118240) (← links)
- More aspects of arbitrarily partitionable graphs (Q2158201) (← links)
- On the parameterized complexity of 2-partitions (Q2205943) (← links)
- Partitioning the Cartesian product of a tree and a cycle (Q2333226) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
- Degree-constrained 2-partitions of graphs (Q2419120) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- (Q3368883) (← links)
- On partitioning the edges of graphs into connected subgraphs (Q3816108) (← links)
- On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)
- Arbitrarily edge-partitionable graphs (Q6648283) (← links)
