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)
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractVolkmann [L. Volkmann, A remark on cycles through an arc in strongly connected multipartite ...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
An n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy in 1976...
AbstractAn n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph, and an m-cycle is a...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a...
AbstractAnn-partite tournament is an orientation of a completen-partite graph. In 1976, Bondy raised...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. We show that if D i...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. We show that if D i...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite tournament...
Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (200...
AbstractA tournament is an orientation of a complete graph and a multipartite tournament is an orien...
Volkmann, Discrete Math. 45 (2002) 19-53, posed the following question. Let 4 be less than or equal...
AbstractIf D is a digraph, then we denote by V(D) its vertex set. A multipartite or c-partite tourna...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractVolkmann [L. Volkmann, A remark on cycles through an arc in strongly connected multipartite ...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...
An n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy in 1976...
AbstractAn n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph, and an m-cycle is a...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a...
AbstractAnn-partite tournament is an orientation of a completen-partite graph. In 1976, Bondy raised...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. We show that if D i...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. We show that if D i...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite tournament...
Gutin and Rafiey [Multipartite tournaments with small number of cycles, Australas J. Combin. 34 (200...
AbstractA tournament is an orientation of a complete graph and a multipartite tournament is an orien...
Volkmann, Discrete Math. 45 (2002) 19-53, posed the following question. Let 4 be less than or equal...
AbstractIf D is a digraph, then we denote by V(D) its vertex set. A multipartite or c-partite tourna...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractVolkmann [L. Volkmann, A remark on cycles through an arc in strongly connected multipartite ...
AbstractA digraph obtained by replacing each edge of a complete n-partite graph by an arc or a pair ...