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
AbstractThe digraphs P(n,k) have vertices corresponding to length k permutations of an n set and arc...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
AbstractIn this paper, we derive some results giving sufficient conditions for a graph G containing ...
AbstractIn the last thirty years many authors were engaged in considering the Hamiltonian behaviour ...
AbstractLet D be a strongly connected digraph of order n. The kth power Dk of D is the digraph with ...
AbstractFor a digraph G, the kth power Gk can be defined in a similar way as in the case of undirect...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
For a strong oriented graph D of order n and diameter d and an integer k with 1 ≤ k ≤ d, the kth pow...
The first part of this paper deals with an extension of Dirac\u27s Theorem to directed graphs. It is...
AbstractA graph G on n vertices is said to be separable cost constant Hamiltonian (SC-Hamiltonian) i...
AbstractIn Bang-Jensen et al. (Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theor...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
AbstractIt is known that if G is a connected simple graph, then G3 is Hamiltonian (in fact, Hamilton...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
AbstractThe digraphs P(n,k) have vertices corresponding to length k permutations of an n set and arc...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
AbstractIn this paper, we derive some results giving sufficient conditions for a graph G containing ...
AbstractIn the last thirty years many authors were engaged in considering the Hamiltonian behaviour ...
AbstractLet D be a strongly connected digraph of order n. The kth power Dk of D is the digraph with ...
AbstractFor a digraph G, the kth power Gk can be defined in a similar way as in the case of undirect...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
For a strong oriented graph D of order n and diameter d and an integer k with 1 ≤ k ≤ d, the kth pow...
The first part of this paper deals with an extension of Dirac\u27s Theorem to directed graphs. It is...
AbstractA graph G on n vertices is said to be separable cost constant Hamiltonian (SC-Hamiltonian) i...
AbstractIn Bang-Jensen et al. (Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theor...
AbstractA graph G is n-hamiltonian (resp. n-edge hamiltonian) if after the removal of any k vertices...
AbstractIt is known that if G is a connected simple graph, then G3 is Hamiltonian (in fact, Hamilton...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
AbstractThe digraphs P(n,k) have vertices corresponding to length k permutations of an n set and arc...
AbstractA strongly connected digraphGwithnvertices satisfying the condition that the sum of degrees ...
AbstractIn this paper, we derive some results giving sufficient conditions for a graph G containing ...