Partitioning perfect graphs into stars

R. van Bevern, R. Bredereck, L. Bulteau, J. Chen, V. Froese, R. Niedermeier, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)

Abstract

The partition of graphs into “nice” subgraphs is a central algorithmic problem with strong ties to matching theory. We study the partitioning of undirected graphs into same-size stars, a problem known to be NP-complete even for the case of stars on three vertices. We perform a thorough computational complexity study of the problem on subclasses of perfect graphs and identify several polynomial-time solvable cases, for example, on interval graphs and bipartite permutation graphs, and also NP-complete cases, for example, on grid graphs and chordal graphs.

Original languageEnglish
Pages (from-to)297-335
Number of pages39
JournalJournal of Graph Theory
Volume85
Issue number2
DOIs
Publication statusPublished - 1 Jun 2017

Keywords

  • generalized matching problem
  • graph algorithms
  • graph factors
  • graph packing
  • P-Partition

Fingerprint

Dive into the research topics of 'Partitioning perfect graphs into stars'. Together they form a unique fingerprint.

Cite this