Multigraph decomposition into multigraphs with two underlying edges
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

Voir la notice de l'article provenant de la source Episciences

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.
@article{DMTCS_2005_special_250_a14,
     author = {Priesler, Miri and Tarsi, Michael},
     title = {Multigraph decomposition into multigraphs with two underlying edges},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3405},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3405/}
}
TY  - JOUR
AU  - Priesler, Miri
AU  - Tarsi, Michael
TI  - Multigraph decomposition into multigraphs with two underlying edges
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3405/
DO  - 10.46298/dmtcs.3405
LA  - en
ID  - DMTCS_2005_special_250_a14
ER  - 
%0 Journal Article
%A Priesler, Miri
%A Tarsi, Michael
%T Multigraph decomposition into multigraphs with two underlying edges
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3405/
%R 10.46298/dmtcs.3405
%G en
%F DMTCS_2005_special_250_a14
Priesler, Miri; Tarsi, Michael. Multigraph decomposition into multigraphs with two underlying edges. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3405. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3405/

Cité par Sources :