AbstractIn this article we present the action of a decomposition criterion for regular tournaments, called W-decomposition on tournaments presenting autonomous parts, and especially those that are undecomposable with respect to W-decomposition
summary:If $x$ is a vertex of a digraph $D$, then we denote by $d^+(x)$ and $d^-(x)$ the outdegre...
summary:If $x$ is a vertex of a digraph $D$, then we denote by $d^+(x)$ and $d^-(x)$ the outdegre...
We define and study the graph-theoretic notion of an anchor in a tournament. An anchor in a tourname...
AbstractIn this article we present the action of a decomposition criterion for regular tournaments, ...
A tournament T of order n is a digraph V(T), A(T) with vertex-set V(T)=&1,2,...,n such that for ever...
AbstractDoubly regular tournaments and homogeneous tournaments are defined and shown to be equivalen...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ ...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
AbstractA digraph T is strong if for every pair of vertices u and v there exists a directed path fro...
We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from ...
International audienceWe only consider finite tournaments. The dual of a tournament is obtained by r...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractThe notions of rotational tournament and the associated symbol set are generalized to r-tour...
summary:If $x$ is a vertex of a digraph $D$, then we denote by $d^+(x)$ and $d^-(x)$ the outdegre...
summary:If $x$ is a vertex of a digraph $D$, then we denote by $d^+(x)$ and $d^-(x)$ the outdegre...
We define and study the graph-theoretic notion of an anchor in a tournament. An anchor in a tourname...
AbstractIn this article we present the action of a decomposition criterion for regular tournaments, ...
A tournament T of order n is a digraph V(T), A(T) with vertex-set V(T)=&1,2,...,n such that for ever...
AbstractDoubly regular tournaments and homogeneous tournaments are defined and shown to be equivalen...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
A regular bipartite tournament is an orientation of a complete balanced bipartite graph $K_{2n,2n}$ ...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
AbstractA digraph T is strong if for every pair of vertices u and v there exists a directed path fro...
We consider a generalisation of Kelly's conjecture which is due to Alspach, Mason, and Pullman from ...
International audienceWe only consider finite tournaments. The dual of a tournament is obtained by r...
AbstractA tournament is an orientation of a complete graph, and in general a multipartite or c-parti...
AbstractThe notions of rotational tournament and the associated symbol set are generalized to r-tour...
summary:If $x$ is a vertex of a digraph $D$, then we denote by $d^+(x)$ and $d^-(x)$ the outdegre...
summary:If $x$ is a vertex of a digraph $D$, then we denote by $d^+(x)$ and $d^-(x)$ the outdegre...
We define and study the graph-theoretic notion of an anchor in a tournament. An anchor in a tourname...
DOI
Add to ORKG