Edge decompositions of multigraphs into multi-2-paths

Edge decompositions of multigraphs into multi-2-paths

We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equal then polynomial.

Bibliographic Details
Main Authors: Jan Kratochvil, Zbigniew Lonc, Mariusz Meszka, Zdzisław Skupień
Format: Article
Language:English
Published: AGH Univeristy of Science and Technology Press 2004-01-01
Series:Opuscula Mathematica
Subjects:
edge decomposition
multigraph
multipath
path
time complexity
Online Access:http://www.opuscula.agh.edu.pl/vol24/1/art/opuscula_math_2408.pdf
id doaj-79fa654fd8424c30be1c08a0feadcea2
record_format Article
spelling doaj-79fa654fd8424c30be1c08a0feadcea22020-11-24T22:40:25ZengAGH Univeristy of Science and Technology PressOpuscula Mathematica1232-92742004-01-01241971022408Edge decompositions of multigraphs into multi-2-pathsJan Kratochvil0Zbigniew Lonc1Mariusz Meszka2Zdzisław Skupień3Charles University, Department of Applied Mathematics, Prague, Czech RepublicWarsaw University of Technology, Faculty of Mathematics and Information Sciences, pl. Politechniki 1, 00-661 Warsaw, PolandAGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Cracow, PolandAGH University of Science and Technology, Faculty of Applied Mathematics, al. Mickiewicza 30, 30-059 Cracow, PolandWe establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equal then polynomial.http://www.opuscula.agh.edu.pl/vol24/1/art/opuscula_math_2408.pdfedge decompositionmultigraphmultipathpathtime complexity
collection DOAJ
language English
format Article
sources DOAJ
author Jan Kratochvil
Zbigniew Lonc
Mariusz Meszka
Zdzisław Skupień
spellingShingle Jan Kratochvil
Zbigniew Lonc
Mariusz Meszka
Zdzisław Skupień
Edge decompositions of multigraphs into multi-2-paths
Opuscula Mathematica
edge decomposition
multigraph
multipath
path
time complexity
author_facet Jan Kratochvil
Zbigniew Lonc
Mariusz Meszka
Zdzisław Skupień
author_sort Jan Kratochvil
title Edge decompositions of multigraphs into multi-2-paths
title_short Edge decompositions of multigraphs into multi-2-paths
title_full Edge decompositions of multigraphs into multi-2-paths
title_fullStr Edge decompositions of multigraphs into multi-2-paths
title_full_unstemmed Edge decompositions of multigraphs into multi-2-paths
title_sort edge decompositions of multigraphs into multi-2-paths
publisher AGH Univeristy of Science and Technology Press
series Opuscula Mathematica
issn 1232-9274
publishDate 2004-01-01
description We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equal then polynomial.
topic edge decomposition
multigraph
multipath
path
time complexity
url http://www.opuscula.agh.edu.pl/vol24/1/art/opuscula_math_2408.pdf
work_keys_str_mv AT jankratochvil edgedecompositionsofmultigraphsintomulti2paths
AT zbigniewlonc edgedecompositionsofmultigraphsintomulti2paths
AT mariuszmeszka edgedecompositionsofmultigraphsintomulti2paths
AT zdzisławskupien edgedecompositionsofmultigraphsintomulti2paths
_version_ 1725705080884166656

Similar Items