Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: edge decompositions

Sortuj według:

Ogranicz wyniki do:

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

Decompositions of multigraphs into parts with the same size

100%

Ivanco J.

Discussiones Mathematicae Graph Theory

2010

tom 30

nr 2

335-347

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 existence of such decompositions if ℱ consists of all multigraphs of size q except for one. Namely, for a multigraph H of size q we find each multigraph M of size kq, such that every partition of the edge set of M into parts of cardinality q contains a part which induces a submultigraph of M isomorphic to H.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Ivanco J.

1 2010

Wyniki wyszukiwania

Decompositions of multigraphs into parts with the same size