Paths with a given number of vertices from each partite set in regular multipartite tournaments
暂无分享,去创建一个
[1] J. Moon. On Subtournaments of a Tournament , 1966, Canadian Mathematical Bulletin.
[2] Anders Yeo. Diregular c-partite tournaments are vertex-pancyclic when c ≥ 5 , 1999 .
[3] Anders Yeo,et al. How Close to Regular Must a Semicomplete Multipartite Digraph Be to Secure Hamiltonicity? , 1997, Graphs Comb..
[4] Lutz Volkmann. Strong subtournaments of multipartite tournaments , 1999, Australas. J Comb..
[5] Lutz Volkmann,et al. Almost all almost regular c-partite tournaments with cgeq5 are vertex pancyclic , 2002, Discret. Math..
[6] Anders Yeo. One-diregular subgraphs in semicomplete multipartite digraphs , 1997 .
[7] Lutz Volkmann,et al. Cycles in multipartite tournaments: results and problems , 2002, Discret. Math..
[8] Gregory Gutin,et al. Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey , 1995, J. Graph Theory.
[9] Charles H. C. Little,et al. Cycles in bipartite tournaments , 1982, J. Comb. Theory, Ser. B.
[10] Lutz Volkmann,et al. Cycles in Multipartite Tournaments , 1994, J. Comb. Theory, Ser. B.
[11] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .
[12] Lutz Volkmann,et al. All regular multipartite tournaments that are cycle complementary , 2004, Discret. Math..
[13] Lutz Volkmann,et al. Cycles with a given number of vertices from each partite set in regular multipartite tournaments , 2006 .
[14] J. Bondy. Diconnected Orientations and a Conjecture of Las Vergnas , 1976 .