DOIAbstract
AbstractWe prove that every tournament of order n⩾68 contains every oriented Hamiltonian cycle except possibly the directed one when the tournament is reducible
AbstractWe prove that every tournament of order n⩾68 contains every oriented Hamiltonian cycle except possibly the directed one when the tournament is reducible
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
Rosenfeld in 1974 conjectured that there is an integer N > 8 such that every tournament of order n >...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
AbstractWe prove that every tournament of order n⩾68 contains every oriented Hamiltonian cycle excep...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
AbstractIt is well known that every tournament has a directed Hamiltonian path. A similar result is ...
AbstractA multipartite tournament is an orientation of a complete k-partite graph for some k ⩾ 2. A ...
AbstractWe characterize weakly Hamiltonian-connected tournaments and weakly panconnected tournaments...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
Rosenfeld in 1974 conjectured that there is an integer N > 8 such that every tournament of order n >...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
AbstractWe prove that every tournament of order n⩾68 contains every oriented Hamiltonian cycle excep...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
AbstractIt is well known that every tournament has a directed Hamiltonian path. A similar result is ...
AbstractA multipartite tournament is an orientation of a complete k-partite graph for some k ⩾ 2. A ...
AbstractWe characterize weakly Hamiltonian-connected tournaments and weakly panconnected tournaments...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
A multipartite tournament is an orientation of a complete k-partite graph for some k 2. A factor of...
Add to ORKG