AbstractIn the last thirty years many authors were engaged in considering the Hamiltonian behaviour of powers of undirected graphs. Started by Sekanina (1960), the investigations in this field have resulted in a lot of interesting and partly very profound propositions; for instance, the famous theorem of Fleischner (1974) on squares of blocks. The surprising thing is that in the case of directed graphs, however, no result of this kind has been published. In this note it is attempted to illustrate the reasons responsible for that different situation and to make a small first step in considering Hamiltonian properties of powers of digraphs
AbstractA graph G on n vertices is said to be separable cost constant Hamiltonian (SC-Hamiltonian) i...
We introduce new necessary conditions, k-quasi-hamiltonicity (0 k n \Gamma 1), for a digraph of or...
This note is motivated by A.Kemnitz and B.Greger, Congr. Numer. 130 (1998)127-131. We show that the ...
AbstractIn the last thirty years many authors were engaged in considering the Hamiltonian behaviour ...
AbstractFor a digraph G, the kth power Gk can be defined in a similar way as in the case of undirect...
For a strong oriented graph D of order n and diameter d and an integer k with 1 ≤ k ≤ d, the kth pow...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
AbstractIn Bang-Jensen et al. (Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theor...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
We will discuss the status of the search for hamiltonian cycles in circulant graphs and circulant di...
We introduce new necessary conditions, k-quasi-hamiltonicity (0kn−1), for a digraph of order n to be...
We introduce new necessary conditions, k-quasi-hamiltonicity (0kn−1), for a digraph of order n to be...
AbstractWe introduce new necessary conditions, k-quasi-hamiltonicity (0⩽k⩽n−1), for a digraph of ord...
Let $\dC_m$ and~$\dC_n$ be directed cycles of length $m$ and~$n$, with $m,n \ge 3$, and let $P(\dC_m...
AbstractA graph G on n vertices is said to be separable cost constant Hamiltonian (SC-Hamiltonian) i...
We introduce new necessary conditions, k-quasi-hamiltonicity (0 k n \Gamma 1), for a digraph of or...
This note is motivated by A.Kemnitz and B.Greger, Congr. Numer. 130 (1998)127-131. We show that the ...
AbstractIn the last thirty years many authors were engaged in considering the Hamiltonian behaviour ...
AbstractFor a digraph G, the kth power Gk can be defined in a similar way as in the case of undirect...
For a strong oriented graph D of order n and diameter d and an integer k with 1 ≤ k ≤ d, the kth pow...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
AbstractIn Bang-Jensen et al. (Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theor...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
We will discuss the status of the search for hamiltonian cycles in circulant graphs and circulant di...
We introduce new necessary conditions, k-quasi-hamiltonicity (0kn−1), for a digraph of order n to be...
We introduce new necessary conditions, k-quasi-hamiltonicity (0kn−1), for a digraph of order n to be...
AbstractWe introduce new necessary conditions, k-quasi-hamiltonicity (0⩽k⩽n−1), for a digraph of ord...
Let $\dC_m$ and~$\dC_n$ be directed cycles of length $m$ and~$n$, with $m,n \ge 3$, and let $P(\dC_m...
AbstractA graph G on n vertices is said to be separable cost constant Hamiltonian (SC-Hamiltonian) i...
We introduce new necessary conditions, k-quasi-hamiltonicity (0 k n \Gamma 1), for a digraph of or...
This note is motivated by A.Kemnitz and B.Greger, Congr. Numer. 130 (1998)127-131. We show that the ...