Multigraph decomposition into multigraphs with two underlying edges - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Multigraph decomposition into multigraphs with two underlying edges

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.
Fichier principal
Vignette du fichier
dmAE0146.pdf (109.46 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184362 , version 1 (14-08-2015)

Identifiers

Cite

Miri Priesler, Michael Tarsi. Multigraph decomposition into multigraphs with two underlying edges. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.231-234, ⟨10.46298/dmtcs.3405⟩. ⟨hal-01184362⟩

Collections

INSMI TDS-MACS
40 View
566 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More