Decomposition of balanced multipartite tournaments into strongly connected tournaments
Combinatorics
2018-12-18 v1
Abstract
Decomposing a digraph into subdigraphs with a fixed structure or property is a classical problem in graph theory and a useful tool in a number of applications of networks and communication. A digraph is strongly connected if it contains a directed path from each vertex to all others. In this paper we consider multipartite tournaments, and we study the existence of a partition of a multipartite tournament with partite sets into strongly connected -tournaments. This is a continuation of the study started in 1999 by Volkmann of the existence of strongly connected subtournaments in multipartite tournaments.
Cite
@article{arxiv.1812.06342,
title = {Decomposition of balanced multipartite tournaments into strongly connected tournaments},
author = {A. P. Figueroa and J. J. Montellano-Ballesteros and M. Olsen},
journal= {arXiv preprint arXiv:1812.06342},
year = {2018}
}
Comments
17 pages