Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: trail

Sortuj według:

Ogranicz wyniki do:

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

Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails

100%

Cichacz S.

Discussiones Mathematicae Graph Theory

2007

tom 27

nr 2

241-249

It has been shown [3] that any bipartite graph $K_{a,b}$, where a, b are even integers, can be decomposed into closed trails with prescribed even lengths. In this article, we consider the corresponding question for directed bipartite graphs. We show that a complete directed bipartite graph $^↔ K_{a,b}$ is decomposable into directed closed trails of even lengths greater than 2, whenever these lengths sum up to the size of the digraph. We use this result to prove that complete bipartite multigraphs can be decomposed in a similar manner.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Cichacz S.

1 2007

Wyniki wyszukiwania

Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails