论文信息 - When n-cycles in n-partite tournaments are longest cycles

When n-cycles in n-partite tournaments are longest cycles

An n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy in 1976 that every strong n-partite tournament has an n-cycle. We characterize strong n-partite tournaments in which a longest cycle is of length n and, thus, settle a problem in Volkmann (Discrete Math. 199 (1999) 279).

Gregory Gutin | Arash Rafiey | G. Gutin | A. Rafiey

[1] Gregory Gutin,et al. Digraphs - theory, algorithms and applications , 2002 .

[2] Lutz Volkmann,et al. Cycles in multipartite tournaments: results and problems , 2002, Discret. Math..

[3] Gregory Gutin,et al. Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey , 1995, J. Graph Theory.

[4] J. Bondy. Diconnected Orientations and a Conjecture of Las Vergnas , 1976 .

[5] Lutz Volkmann,et al. Longest paths in semicomplete multipartite digraphs , 1999, Discret. Math..

[6] Lutz Volkmann,et al. On cycles through a given vertex in multipartite tournaments , 1997, Discret. Math..

[7] P. Paulraja,et al. Note on the existence of directed (k + 1)-cycles in diconnected complete k-partite digraphs , 1984, J. Graph Theory.

[8] Lutz Volkmann,et al. Cycles in Multipartite Tournaments , 1994, J. Comb. Theory, Ser. B.

[9] Gregory Gutin,et al. Generalizations of tournaments: A survey , 1998, J. Graph Theory.