100
click to vote
IWOCA
2009
Springer
15 years 9 months ago
2009
Springer
We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is full...