Multigraph decomposition into multigraphs with two underlying edges

Due to some intractability considerations, reasonable formulation of necessary and sufficient conditions for decomposability of a general multigraph G into a fixed connected multigraph H, is probably not feasible if the underlying simple graph of H has three or more edges. We study the case where H...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Mathematics and Theoretical Computer Science Vol. DMTCS Proceedings vol. AE,...; no. Proceedings; pp. 231 - 234
Main Authors Priesler, Miri, Tarsi, Michael
Format Journal Article Conference Proceeding
LanguageEnglish
Published DMTCS 01.01.2005
Discrete Mathematics and Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
SeriesDMTCS Proceedings
Subjects
[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
[math.math-co] mathematics [math]/combinatorics [math.co]
Combinatorics
Computer Science
decomposition
Discrete Mathematics
Mathematics
multigraph
npc
NPC
Multigraph
Decomposition
Online AccessGet full text

Cover

More Information
Summary:Due to some intractability considerations, reasonable formulation of necessary and sufficient conditions for decomposability of a general multigraph G into a fixed connected multigraph H, is probably not feasible if the underlying simple graph of H has three or more edges. We study the case where H consists of two underlying edges. We present necessary and sufficient conditions for H-decomposability of G, which hold when certain size parameters of G lies within some bounds which depends on the multiplicities of the two edges of H. We also show this result to be "tight" in the sense that even a slight deviation of these size parameters from the given bounds results intractability of the corresponding decision problem.
ISSN:1365-8050
1462-7264
1365-8050
DOI:10.46298/dmtcs.3405