Cycles through a given arc in almost regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Australas. J Comb., 2003)

Strong subtournaments of close to regular multipartite tournaments. - Stefan Winzen (Australas. J Comb., 2004)

Cycles through a given arc and certain partite sets in almost regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2004)

Almost regular multipartite tournaments containing a Hamiltonian path through a given arc. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2004)

Almost regular c-partite tournaments with c ≥ 8 contain an n-cycle through a given arc for 4 ≤ n ≤ c. - Lutz Volkmann; Stefan Winzen (Australas. J Comb., 2005)

On the connectivity of close to regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Discret. Appl. Math., 2006)

Paths with a given number of vertices from each partite set in regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2006)

Strongly 4-path-connectivity in almost regular multipartite tournaments. - Irene Stella; Lutz Volkmann; Stefan Winzen (Discret. Math., 2007)

Restricted arc-connectivity of generalized tournaments. - Dirk Meierling; Lutz Volkmann; Stefan Winzen (Australas. J Comb., 2008)

How close to regular must a multipartite tournament be to secure a given path covering number? - Irene Stella; Lutz Volkmann; Stefan Winzen (Ars Comb., 2008)

Almost regular c-partite tournaments contain a strong subtournament of order c when c >= 5. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2008)

Strong subtournaments containing a given vertex in regular multipartite tournaments. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2008)

Complementary cycles in regular multipartite tournaments, where one cycle has length five. - Zhihong He; Torsten Korneffel; Dirk Meierling; Lutz Volkmann; Stefan Winzen (Discret. Math., 2009)

Every cycle-connected multipartite tournament has a universal arc. - Lutz Volkmann; Stefan Winzen (Discret. Math., 2009)