Decomposition of balanced multipartite tournaments into strongly connected tournaments
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 $c$ partite sets into strongly connected $c$-tournaments. This is a continuation of the study started in 1999 by Volkmann of the existence of strongly connected subtournaments in multipartite tournaments.
math.CO↗