AbstractA multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are obtained of the numbers of unlabeled acyclic and unicyclic multipartite tournaments, and unlabeled bipartite tournaments with exactly k cycles, which are pairwise vertex-disjoint
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractChen et al. [Partitioning vertices of a tournament into independent cycles, J. Combin. Theor...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a...
A multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are...
AbstractA multipartite tournament is an orientation of a complete multipartite graph. A tournament i...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite tournament...
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 a multipartite tournament is an orien...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractAnn-partite tournament is an orientation of a completen-partite graph. In 1976, Bondy raised...
AbstractWe show that in any n-partite tournament, where n ⩾ 3, with no transmitters and no 3-kings, ...
summary:If $x$ is a vertex of a digraph $D$, then we denote by $d^+(x)$ and $d^-(x)$ the outdegre...
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, and an m-cycle is a...
AbstractWe present a variety of results concerning characterization, number, distribution and some a...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractChen et al. [Partitioning vertices of a tournament into independent cycles, J. Combin. Theor...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a...
A multipartite tournament is an orientation of a complete multipartite graph. Simple derivations are...
AbstractA multipartite tournament is an orientation of a complete multipartite graph. A tournament i...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite tournament...
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 a multipartite tournament is an orien...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractAnn-partite tournament is an orientation of a completen-partite graph. In 1976, Bondy raised...
AbstractWe show that in any n-partite tournament, where n ⩾ 3, with no transmitters and no 3-kings, ...
summary:If $x$ is a vertex of a digraph $D$, then we denote by $d^+(x)$ and $d^-(x)$ the outdegre...
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, and an m-cycle is a...
AbstractWe present a variety of results concerning characterization, number, distribution and some a...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractChen et al. [Partitioning vertices of a tournament into independent cycles, J. Combin. Theor...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a...
DOI
Add to ORKG