Multigraph decomposition into stars and into multistars

Miri Priesler; Michael Tarsi

doi:10.1016/j.disc.2005.03.012

Multigraph decomposition into stars and into multistars

Miri Priesler^*, Michael Tarsi

^*Corresponding author for this work

School of Computer Science

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

12 Scopus citations

Abstract

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 language	English
Pages (from-to)	235-244
Number of pages	10
Journal	Discrete Mathematics
Volume	296
Issue number	2-3
DOIs	https://doi.org/10.1016/j.disc.2005.03.012
State	Published - 6 Jul 2005

Keywords

Decomposition
Multigraphs
NPC
Stars

Access to Document

10.1016/j.disc.2005.03.012

Cite this

@article{b7962cb1883e4ccf9635e5810cf03b3e,

title = "Multigraph decomposition into stars and into multistars",

abstract = "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.",

keywords = "Decomposition, Multigraphs, NPC, Stars",

author = "Miri Priesler and Michael Tarsi",

year = "2005",

month = jul,

day = "6",

doi = "10.1016/j.disc.2005.03.012",

language = "אנגלית",

volume = "296",

pages = "235--244",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "2-3",

}

TY - JOUR

T1 - Multigraph decomposition into stars and into multistars

AU - Priesler, Miri

AU - Tarsi, Michael

PY - 2005/7/6

Y1 - 2005/7/6

N2 - 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.

AB - 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.

KW - Decomposition

KW - Multigraphs

KW - NPC

KW - Stars

UR - http://www.scopus.com/inward/record.url?scp=22144477214&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2005.03.012

DO - 10.1016/j.disc.2005.03.012

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:22144477214

SN - 0012-365X

VL - 296

SP - 235

EP - 244

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2-3

ER -

Multigraph decomposition into stars and into multistars

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this