Decomposition of Complete Bipartite Digraphs and Even Complete Bipartite Multigraphs into Closed Trails

@inproceedings{Cichacz2007DecompositionOC,
  title={Decomposition of Complete Bipartite Digraphs and Even Complete Bipartite Multigraphs into Closed Trails},
  author={Sylwia Cichacz},
  year={2007}
}
It has been shown [3] that any bipartite graph Ka,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… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-3 of 3 references

Decomposition of complete bipartite even graphs into closed trails

M. Horňák, M. Woźniak
Czechoslovak Math. J • 2003
View 4 Excerpts
Highly Influenced

Packing Digraphs With Directed Closed Trails

Combinatorics, Probability & Computing • 2003

Packing Circuits Into KN

Combinatorics, Probability & Computing • 2001
View 1 Excerpt

Similar Papers

Loading similar papers…