Multigraph decomposition into stars and into multistars

Miri Priesler*, Michael Tarsi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


We study the decomposition of multigraphs with a constant edge multiplicity into copies of a fixed star H=K1,t: We present necessary and sufficient conditions for such a decomposition to exist where t=2 and prove NP-completeness of the corresponding decision problem for any t≥3. We also prove NP-completeness when the edge multiplicity function is not restricted either on the input G or on the fixed multistar H.

Original languageEnglish
Pages (from-to)235-244
Number of pages10
JournalDiscrete Mathematics
Issue number2-3
StatePublished - 6 Jul 2005


  • Decomposition
  • Multigraphs
  • NPC
  • Stars


Dive into the research topics of 'Multigraph decomposition into stars and into multistars'. Together they form a unique fingerprint.

Cite this