@article{MekkiaKouider1998,
abstract = {In this note, we consider the problem of existence of an edge-decomposition of a multigraph into isomorphic copies of 2-edge paths $K_\{1,2\}$. We find necessary and sufficient conditions for such a decomposition of a multigraph H to exist when
(i) either H does not have incident multiple edges or
(ii) multiplicities of the edges in H are not greater than two. In particular, we answer a problem stated by Z. Skupień.},
author = {Mekkia Kouider, Maryvonne Mahéo, Krzysztof Bryś, Zbigniew Lonc},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {edge decomposition; multigraph; perfect matching; edge-decomposition},
language = {eng},
number = {2},
pages = {225-232},
title = {Decomposition of multigraphs},
url = {http://eudml.org/doc/270489},
volume = {18},
year = {1998},
}
TY - JOUR
AU - Mekkia Kouider
AU - Maryvonne Mahéo
AU - Krzysztof Bryś
AU - Zbigniew Lonc
TI - Decomposition of multigraphs
JO - Discussiones Mathematicae Graph Theory
PY - 1998
VL - 18
IS - 2
SP - 225
EP - 232
AB - In this note, we consider the problem of existence of an edge-decomposition of a multigraph into isomorphic copies of 2-edge paths $K_{1,2}$. We find necessary and sufficient conditions for such a decomposition of a multigraph H to exist when
(i) either H does not have incident multiple edges or
(ii) multiplicities of the edges in H are not greater than two. In particular, we answer a problem stated by Z. Skupień.
LA - eng
KW - edge decomposition; multigraph; perfect matching; edge-decomposition
UR - http://eudml.org/doc/270489
ER -
