Multigraph decomposition into multigraphs with two underlying edges - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2005

Multigraph decomposition into multigraphs with two underlying edges

Résumé

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.

Mots clés

Fichier principal
Vignette du fichier
dmAE0146.pdf (109.46 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

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

Identifiants

Citer

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
42 Consultations
652 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More