Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: edge decomposition

Sortuj według:

Ogranicz wyniki do:

Artykuł dostępny w postaci pełnego tekstu - kliknij by otworzyć plik

Decomposition of multigraphs

100%

Kouider M., Mahéo M., Bryś K., Lonc Z.

Discussiones Mathematicae Graph Theory

1998

tom 18

nr 2

225-232

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ń.

Decompositions of multigraphs into parts with two edges

80%

Ivančo J., Meszka M., Skupień Z.

Discussiones Mathematicae Graph Theory

2002

tom 22

nr 1

113-121

Given a family 𝓕 of multigraphs without isolated vertices, a multigraph M is called 𝓕-decomposable if M is an edge disjoint union of multigraphs each of which is isomorphic to a member of 𝓕. We present necessary and sufficient conditions for the existence of such decompositions if 𝓕 comprises two multigraphs from the set consisting of a 2-cycle, a 2-matching and a path with two edges.

Ograniczanie wyników

2 Discussiones Mathematicae Graph Theory

1 Bryś K.

1 Ivančo J.

1 Kouider M.

1 Lonc Z.

1 Mahéo M.

1 Meszka M.

1 Skupień Z.

1 2002

1 1998

Wyniki wyszukiwania

Decomposition of multigraphs

Decompositions of multigraphs into parts with two edges