AbstractIn this paper we prove that every tournament Tn with n = 2k ≥ 28 vertices has an antidirected Hamiltonian circuit as was conjectured by Grünbaum [3]. We also investigate the number of distinct antidirected Hamiltonian paths and circuits in Tn and obtain upper bounds for these numbers
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
AbstractWe characterize those bipartite tournaments which have a hamiltonian path with given unorder...
AbstractIn this paper we present a short proof of Grünbaum's theorem concerning the existence of ant...
AbstractIt is well known that every tournament has a directed Hamiltonian path. A similar result is ...
AbstractIt is well known that every tournament has a directed Hamiltonian path. A similar result is ...
AbstractWe prove that in any tournament there is an antidirected hamiltonian path from a specified f...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractIn this paper we present a short proof of Grünbaum's theorem concerning the existence of ant...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
AbstractWe characterize weakly Hamiltonian-connected tournaments and weakly panconnected tournaments...
AbstractWe characterize those bipartite tournaments which have a hamiltonian path with given unorder...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
AbstractWe prove that in any tournament there is an antidirected hamiltonian path from a specified f...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
AbstractWe characterize those bipartite tournaments which have a hamiltonian path with given unorder...
AbstractIn this paper we present a short proof of Grünbaum's theorem concerning the existence of ant...
AbstractIt is well known that every tournament has a directed Hamiltonian path. A similar result is ...
AbstractIt is well known that every tournament has a directed Hamiltonian path. A similar result is ...
AbstractWe prove that in any tournament there is an antidirected hamiltonian path from a specified f...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractIn this paper we present a short proof of Grünbaum's theorem concerning the existence of ant...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
AbstractWe characterize weakly Hamiltonian-connected tournaments and weakly panconnected tournaments...
AbstractWe characterize those bipartite tournaments which have a hamiltonian path with given unorder...
AbstractThe main results assert that the minimum number of Hamiltonian bypasses in a strong tourname...
AbstractWe prove that with three exceptions, every tournament of order n contains each oriented path...
AbstractWe prove that in any tournament there is an antidirected hamiltonian path from a specified f...
In this work we consider a generalisation of Kelly's conjecture which is due Alspach, Mason, and Pul...
AbstractA digraph without loops, multiple arcs and directed cycles of length two is called a local t...
AbstractWe characterize those bipartite tournaments which have a hamiltonian path with given unorder...
DOI
Add to ORKG