AbstractA multipartite or c-partite tournament is an orientation of a complete c-partite graph. In this survey we mainly describe results on directed cycles and paths in strongly connected c-partite tournaments for c⩾3. In addition, we include about 40 open problems and conjectures
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
An n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy in 1976...
AbstractA tournament is an orientation of a complete graph and a multipartite or c-partite tournamen...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite tournament...
This thesis mainly deals with the existence of directed cycles and directed paths (or short: cycles ...
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 or c-parti...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a...
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 a multipartite tournament is an orien...
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, and an m-cycle is a...
AbstractA multipartite tournament is an orientation of a complete multipartite graph. A tournament i...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
An n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy in 1976...
AbstractA tournament is an orientation of a complete graph and a multipartite or c-partite tournamen...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite tournament...
This thesis mainly deals with the existence of directed cycles and directed paths (or short: cycles ...
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 or c-parti...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a...
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 a multipartite tournament is an orien...
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, and an m-cycle is a...
AbstractA multipartite tournament is an orientation of a complete multipartite graph. A tournament i...
AbstractAn n-partite tournament is an orientation of a complete n-partite graph. In this paper, we g...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
An n-tournament is an orientation of a complete n-partite graph. It was proved by J.A. Bondy in 1976...
AbstractA tournament is an orientation of a complete graph and a multipartite or c-partite tournamen...
DOI
Add to ORKG