Fully Decomposable Split Graphs

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 fully decomposable.

• Type: Conference
• Year: 2009
• Where: IWOCA
• Authors: Hajo Broersma, Dieter Kratsch, Gerhard J. Woeginger
• Keywords: Algorithms, Connected Parts, IWOCA 2009, Polynomial Time Algorithm, Split Graph