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

Sylwia Cichacz

Discussiones Mathematicae Graph Theory (2007)

  • Volume: 27, Issue: 2, page 241-249
  • ISSN: 2083-5892

Abstract

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

How to cite

top

Sylwia Cichacz. "Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails." Discussiones Mathematicae Graph Theory 27.2 (2007): 241-249. <http://eudml.org/doc/270717>.

@article{SylwiaCichacz2007,
abstract = {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.},
author = {Sylwia Cichacz},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {trail; decomposition},
language = {eng},
number = {2},
pages = {241-249},
title = {Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails},
url = {http://eudml.org/doc/270717},
volume = {27},
year = {2007},
}

TY - JOUR
AU - Sylwia Cichacz
TI - Decomposition of complete bipartite digraphs and even complete bipartite multigraphs into closed trails
JO - Discussiones Mathematicae Graph Theory
PY - 2007
VL - 27
IS - 2
SP - 241
EP - 249
AB - 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.
LA - eng
KW - trail; decomposition
UR - http://eudml.org/doc/270717
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.