The following pages link to Fully decomposable split graphs (Q1933640):
Displaying 9 items.
- \(O(m\log n)\) split decomposition of strongly-connected graphs (Q972339) (← links)
- Decomposable trees: A polynomial algorithm for tripodes (Q1613342) (← links)
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs (Q2118240) (← links)
- More aspects of arbitrarily partitionable graphs (Q2158201) (← links)
- Partitioning the Cartesian product of a tree and a cycle (Q2333226) (← links)
- Dense on-line arbitrarily partitionable graphs (Q2357776) (← links)
- On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)
- Closure results for arbitrarily partitionable graphs (Q6642846) (← links)
- Arbitrarily edge-partitionable graphs (Q6648283) (← links)