Let $\dC_m$ and~$\dC_n$ be directed cycles of length $m$ and~$n$, with $m,n \ge 3$, and let $P(\dC_m \cartprod \dC_n)$ be the digraph that is obtained from the Cartesian product $\dC_m \cartprod \dC_n$ by choosing a vertex~$v$, and reversing the orientation of all four directed edges that are incident with~$v$. (This operation is called ``pushing'' at the vertex~$v$.) By applying a special case of unpublished work of S.\,X.\,Wu, we find elementary number-theoretic necessary and sufficient conditions for the existence of a hamiltonian cycle in $P(\dC_m \cartprod \dC_n)$. \\ A consequence is that if $P(\dC_m \cartprod \dC_n)$ is hamiltonian, then $\gcd(m,n) = 1$, which implies that $\dC_m \cartprod \dC_n$ is not hamiltonian. This final conclu...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
Every connected simple graph G has an acyclic orientation. Define a graph AO(G) whose vertices are ...
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs ar...
Abstract. Let (Za Zb) (Zc Zd) be the product of two directed cycles minus a subgroup. Also, let ...
We prove that for every $\varepsilon > 0$ there exists $n_0=n_0(\varepsilon)$ such that every regula...
In 1960 Ghouila-Houri extended Dirac’s theorem to directed graphs by proving that if D is a directed...
Abstract. Let n be sufficiently large and suppose that G is a digraph on n vertices where every vert...
AbstractLet Gnbe the complete graph on the vertex set [ n ] = {1, 2,⋯ , n } and ω an orientation of ...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
We study Hamiltonicity in graphs obtained as the union of a deterministic $n$-vertex graph $H$ with ...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
We prove that for every ε>0 there exists n0=n0(ε) such that every regular oriented graph on n>...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
AbstractThe cartesian product of a graph G with K2 is called a prism over G. We extend known conditi...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
Every connected simple graph G has an acyclic orientation. Define a graph AO(G) whose vertices are ...
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs ar...
Abstract. Let (Za Zb) (Zc Zd) be the product of two directed cycles minus a subgroup. Also, let ...
We prove that for every $\varepsilon > 0$ there exists $n_0=n_0(\varepsilon)$ such that every regula...
In 1960 Ghouila-Houri extended Dirac’s theorem to directed graphs by proving that if D is a directed...
Abstract. Let n be sufficiently large and suppose that G is a digraph on n vertices where every vert...
AbstractLet Gnbe the complete graph on the vertex set [ n ] = {1, 2,⋯ , n } and ω an orientation of ...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
We study Hamiltonicity in graphs obtained as the union of a deterministic $n$-vertex graph $H$ with ...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
We prove that for every ε>0 there exists n0=n0(ε) such that every regular oriented graph on n>...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
AbstractThe cartesian product of a graph G with K2 is called a prism over G. We extend known conditi...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
Every connected simple graph G has an acyclic orientation. Define a graph AO(G) whose vertices are ...
A Hamilton cycle in a digraph is a cycle that passes through all the vertices, where all the arcs ar...