Add to ORKGWe prove that, with some exceptions, every digraph with n 3 9 vertices and at least ( n- 1) (n- 2) + 2 arcs contains all orientations of a Hamil-tonian cycle. 1
We prove that for every $\varepsilon > 0$ there exists $n_0=n_0(\varepsilon)$ such that every regula...
AbstractWe show that for each ℓ⩾4 every sufficiently large oriented graph G with δ+(G),δ−(G)⩾⌊|G|/3⌋...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
Abstract. Let n be sufficiently large and suppose that G is a digraph on n vertices where every vert...
AbstractWe show that a 2-connected oriented graph of order n, with at least 12n(n − 1) −2 arcs is Ha...
AbstractThe digraphs P(n,k) have vertices corresponding to length k permutations of an n set and arc...
We show that every sufficiently large oriented graph with minimum in- and outdegree at least (3n-4)/...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
We will discuss the status of the search for hamiltonian cycles in circulant graphs and circulant di...
The problem of finding necessary and sufficient conditions for a semicomplete multipartite digraphs ...
For a strong oriented graph D of order n and diameter d and an integer k with 1 ≤ k ≤ d, the kth pow...
In 1960 Ghouila-Houri extended Dirac’s theorem to directed graphs by proving that if D is a directed...
We prove that for every ε>0 there exists n0=n0(ε) such that every regular oriented graph on n>...
A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices ...
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. F...
We prove that for every $\varepsilon > 0$ there exists $n_0=n_0(\varepsilon)$ such that every regula...
AbstractWe show that for each ℓ⩾4 every sufficiently large oriented graph G with δ+(G),δ−(G)⩾⌊|G|/3⌋...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
Abstract. Let n be sufficiently large and suppose that G is a digraph on n vertices where every vert...
AbstractWe show that a 2-connected oriented graph of order n, with at least 12n(n − 1) −2 arcs is Ha...
AbstractThe digraphs P(n,k) have vertices corresponding to length k permutations of an n set and arc...
We show that every sufficiently large oriented graph with minimum in- and outdegree at least (3n-4)/...
A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton ...
We will discuss the status of the search for hamiltonian cycles in circulant graphs and circulant di...
The problem of finding necessary and sufficient conditions for a semicomplete multipartite digraphs ...
For a strong oriented graph D of order n and diameter d and an integer k with 1 ≤ k ≤ d, the kth pow...
In 1960 Ghouila-Houri extended Dirac’s theorem to directed graphs by proving that if D is a directed...
We prove that for every ε>0 there exists n0=n0(ε) such that every regular oriented graph on n>...
A digraph D is called a quasi-transitive digraph (QTD) if for any triple x,y,z of distinct vertices ...
In 2003, Bohman, Frieze, and Martin initiated the study of randomly perturbed graphs and digraphs. F...
We prove that for every $\varepsilon > 0$ there exists $n_0=n_0(\varepsilon)$ such that every regula...
AbstractWe show that for each ℓ⩾4 every sufficiently large oriented graph G with δ+(G),δ−(G)⩾⌊|G|/3⌋...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...