AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tournament of order n and the minimum number of Hamiltonian cycles in a 2-connected tournament of order n increase exponentially with n. Furthermore, the number of Hamiltonian cycles in a tournament increases at least exponentially with the minimum outdegree of the tournament. Finally, for each k⩾1 there are infinitely many tournaments with precisely k Hamiltonian cycles
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices....
AbstractWe prove that every tournament of order n⩾68 contains every oriented Hamiltonian cycle excep...
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices....
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
Busch recently determined the minimum number of Hamiltonian paths a strong tournament can have. We c...
AbstractWe characterize weakly Hamiltonian-connected tournaments and weakly panconnected tournaments...
AbstractIn this paper we prove that every tournament Tn with n = 2k ≥ 28 vertices has an antidirecte...
In [6], Thomassen conjectured that if I is a set of k \Gamma 1 arcs in a k-strong tournament T , th...
Let V be a n-set (set of size n). Let E be the collection of all possible k-subsets (subsets of size...
For a random tournament on $3^n$ vertices, the expected number of Hamiltonian cycles is known to be ...
AbstractLet M(k) denote the maximum number of cycles in a Hamiltonian graph of order n and size n+k....
AbstractG = 〈V(G), E(G)〉 denotes a directed graph without loops and multiple arrows. K(G) denotes th...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
Let T be a hamiltonian tournament with n vertices and a hamil-tonian cycle of T. In previous works...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices....
AbstractWe prove that every tournament of order n⩾68 contains every oriented Hamiltonian cycle excep...
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices....
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
Busch recently determined the minimum number of Hamiltonian paths a strong tournament can have. We c...
AbstractWe characterize weakly Hamiltonian-connected tournaments and weakly panconnected tournaments...
AbstractIn this paper we prove that every tournament Tn with n = 2k ≥ 28 vertices has an antidirecte...
In [6], Thomassen conjectured that if I is a set of k \Gamma 1 arcs in a k-strong tournament T , th...
Let V be a n-set (set of size n). Let E be the collection of all possible k-subsets (subsets of size...
For a random tournament on $3^n$ vertices, the expected number of Hamiltonian cycles is known to be ...
AbstractLet M(k) denote the maximum number of cycles in a Hamiltonian graph of order n and size n+k....
AbstractG = 〈V(G), E(G)〉 denotes a directed graph without loops and multiple arrows. K(G) denotes th...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
Let T be a hamiltonian tournament with n vertices and a hamil-tonian cycle of T. In previous works...
Abstract. We show that every sufficiently large regular tournament can almost completely be decompos...
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices....
AbstractWe prove that every tournament of order n⩾68 contains every oriented Hamiltonian cycle excep...
A tournament is a digraph, where there is precisely one arc between every pair of distinct vertices....
DOI
Add to ORKG