On cycles in regular 3-partite tournamentsVOLKMANN, Lutz.Discrete mathematics. 2006, Vol 306, Num 12, pp 1198-1206, issn 0012-365X, 9 p.Article

Longest cycles in almost regular 3-partite tournamentsVOLKMANN, Lutz.Discrete mathematics. 2006, Vol 306, Num 22, pp 2931-2942, issn 0012-365X, 12 p.Article

Paths with a given number of vertices from each partite set in regular multipartite tournamentsVOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2006, Vol 306, Num 21, pp 2724-2732, issn 0012-365X, 9 p.Article

Almost regular c-partite tournaments contain a strong subtournament of order c when c≥5VOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2008, Vol 308, Num 9, pp 1710-1721, issn 0012-365X, 12 p.Article

On the connectivity of close to regular multipartite tournamentsVOLKMANN, Lutz; WINZEN, Stefan.Discrete applied mathematics. 2006, Vol 154, Num 9, pp 1437-1452, issn 0166-218X, 16 p.Conference Paper

Strong subtournaments containing a given vertex in regular multipartite tournamentsVOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2008, Vol 308, Num 23, pp 5516-5521, issn 0012-365X, 6 p.Article

Cycles through arcs in multipartite tournaments and a conjecture of VolkmannHONGWEI LI; SHENGJIA LI; YUBAO GUO et al.Applied mathematics letters. 2011, Vol 24, Num 4, pp 412-415, issn 0893-9659, 4 p.Article

Strong subtournaments of order c containing a given vertex in regular c-partite tournaments with c ≥ 16GAOKUI XU; SHENGJIA LI; HONGWEI LI et al.Discrete mathematics. 2011, Vol 311, Num 20, pp 2272-2275, issn 0012-365X, 4 p.Article

On the 3-kings and 4-kings in multipartite tournamentsTAN, B. P.Discrete mathematics. 2006, Vol 306, Num 21, pp 2702-2710, issn 0012-365X, 9 p.Article

Complementary cycles in regular multipartite tournaments, where one cycle has length fiveZHIHONG HE; KORNEFFEL, Torsten; MEIERLING, Dirk et al.Discrete mathematics. 2009, Vol 309, Num 10, pp 3131-3149, issn 0012-365X, 19 p.Article

On the kings and kings-of-kings in semicomplete multipartite digraphsTAN, B. P.Discrete mathematics. 2005, Vol 290, Num 2-3, pp 249-258, issn 0012-365X, 10 p.Article

3-Kings in 3-partite tournamentsPETROVIC, Vojislav; TREML, Miroslav.Discrete mathematics. 2008, Vol 308, Num 2-3, pp 277-286, issn 0012-365X, 10 p.Conference Paper

On semicomplete multipartite digraphs whose king sets are semicomplete digraphsTAN, B. P.Discrete mathematics. 2008, Vol 308, Num 12, pp 2564-2570, issn 0012-365X, 7 p.Article

Toppling kings in multipartite tournaments by introducing new kingsBRCANOV, Dejan; PETROVIC, Vojislav.Discrete mathematics. 2010, Vol 310, Num 19, pp 2550-2554, issn 0012-365X, 5 p.Article

A remark on cycles through an arc in strongly connected multipartite tournamentsVOLKMANN, Lutz.Applied mathematics letters. 2007, Vol 20, Num 11, pp 1148-1150, issn 0893-9659, 3 p.Article

Strongly 4-path-connectivity in almost regular multipartite tournamentsSTELLA, Irene; VOLKMANN, Lutz; WINZEN, Stefan et al.Discrete mathematics. 2007, Vol 307, Num 24, pp 3213-3219, issn 0012-365X, 7 p.Article

Almost all almost regular c-partite tournaments with c ≥ 5 are vertex pancyclicTEWES, Meike; VOLKMANN, Lutz; YEO, Anders et al.Discrete mathematics. 2002, Vol 242, Num 1-3, pp 201-228, issn 0012-365XArticle

Multipartite tournaments : A surveyVOLKMANN, Lutz.Discrete mathematics. 2007, Vol 307, Num 24, pp 3097-3129, issn 0012-365X, 33 p.Article

Every cycle-connected multipartite tournament has a universal arcVOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2009, Vol 309, Num 4, pp 1013-1017, issn 0012-365X, 5 p.Article

Almost regular multipartite tournaments containing a Hamiltonian path through a given arcVOLKMANN, Lutz; WINZEN, Stefan.Discrete mathematics. 2004, Vol 285, Num 1-3, pp 267-278, issn 0012-365X, 12 p.Article

Hamiltonian paths containing a given arc, in almost regular bipartite tournamentsVOLKMANN, Lutz.Discrete mathematics. 2004, Vol 285, Num 1-3, pp 359-364, issn 0012-365X, 6 p.Article

Outpaths in semicomplete multipartite digraphsYUBAO GUO.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 273-277, issn 0166-218XConference Paper