Fully decomposable split graphs

H.J. Broersma, D. Kratsch, G.J. Woeginger

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

Abstract

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, i.e., whether it can be partitioned into connected parts of order a 1,a 2,...,a k for every a 1,a 2,...,a k summing up to the order of the graph. In contrast, we show that the decision problem whether a given split graph can be partitioned into connected parts of order a 1,a 2,...,a k for a given partition a 1,a 2,...,a k of the order of the graph, is NP-hard.
Original languageEnglish
Title of host publicationCombinatorial Algorithms (20th International Workshop, IWOCA 2009, Hradec nad Moravici, Czech Republic, June 28-July 2, 2009, Revised Selected Papers)
EditorsJ. Fiala, J. Kratochvil, M. Miller
Place of PublicationBerlin
PublisherSpringer
Pages105-112
ISBN (Print)978-3-642-10216-5
DOIs
Publication statusPublished - 2009

Publication series

NameLecture Notes in Computer Science
Volume5874
ISSN (Print)0302-9743

Fingerprint

Dive into the research topics of 'Fully decomposable split graphs'. Together they form a unique fingerprint.

Cite this