Decomposition of balanced multipartite tournaments into strongly\n connected tournaments

2018/12/15 by Ana Paulina Figueroa, Juan José Montellano‐Ballesteros, Figueroa, A. P. +5
Computer Science · Engineering · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1812.06342

openalex publication_date 2018/12/15 · openalex created_date 2022/08/01 · openalex updated_date 2026/07/28

Abstract

Decomposing a digraph into subdigraphs with a fixed structure or property is\na classical problem in graph theory and a useful tool in a number of\napplications of networks and communication. A digraph is strongly connected if\nit contains a directed path from each vertex to all others. In this paper we\nconsider multipartite tournaments, and we study the existence of a partition of\na multipartite tournament with c partite sets into strongly connected\nc-tournaments. This is a continuation of the study started in 1999 by\nVolkmann of the existence of strongly connected subtournaments in multipartite\ntournaments.\n

Related

• Partitioning a tournament into sub-tournaments of high connectivity
• Solution on strong partition of 2-balanced regular multipartite tournaments
• Bipartitions of highly connected tournaments
• Conditions on the regularity of balanced c-partite tournaments for the existence of strong subtournaments with high minimum degree
• On cycles through two arcs in strong multipartite tournaments