Multigraph decomposition into multigraphs with two underlying edges

Miri Priesler, Michael Tarsi

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

Abstract

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.

Original languageEnglish
Title of host publicationIMETI 2008 - International Multi-Conference on Engineering and Technological Innovation, Proceedings
Pages201-208
Number of pages8
StatePublished - 2008
EventInternational Multi-Conference on Engineering and Technological Innovation, IMETI 2008 - Orlando, FL, United States
Duration: 29 Jun 20082 Jul 2008

Publication series

NameIMETI 2008 - International Multi-Conference on Engineering and Technological Innovation, Proceedings
Volume1

Conference

ConferenceInternational Multi-Conference on Engineering and Technological Innovation, IMETI 2008
Country/TerritoryUnited States
CityOrlando, FL
Period29/06/082/07/08

Keywords

  • Decompositions
  • Intractability
  • Muitistars
  • Multigraphs
  • Stars

Fingerprint

Dive into the research topics of 'Multigraph decomposition into multigraphs with two underlying edges'. Together they form a unique fingerprint.

Cite this