We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this type combine local structure of the digraph with conditions on the degrees of nonadjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs of nonadjacent vertices. Our results generalize the classical conditions by Ghouila-Houri and Woodall
The first part of this paper deals with an extension of Dirac's Theorem to directed graphs. It is re...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
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...
AbstractThree sufficient conditions for a graph to be Hamiltonian are given. These theorems are in t...
AbstractIn Bang-Jensen et al. (Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theor...
AbstractWe introduce new necessary conditions, k-quasi-hamiltonicity (0⩽k⩽n−1), for a digraph of ord...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
A necessary and a sufficient condition are derived for a graph to be non-Hamiltonian
We introduce new necessary conditions, k-quasi-hamiltonicity (0 k n \Gamma 1), for a digraph of or...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
We describe a new type of sufficient condition for a balanced bipartitedigraph to be hamiltonian. Le...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
The first part of this paper deals with an extension of Dirac's Theorem to directed graphs. It is re...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
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...
AbstractThree sufficient conditions for a graph to be Hamiltonian are given. These theorems are in t...
AbstractIn Bang-Jensen et al. (Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theor...
AbstractWe introduce new necessary conditions, k-quasi-hamiltonicity (0⩽k⩽n−1), for a digraph of ord...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
A necessary and a sufficient condition are derived for a graph to be non-Hamiltonian
We introduce new necessary conditions, k-quasi-hamiltonicity (0 k n \Gamma 1), for a digraph of or...
Graph TheoryWe prove a sharp Meyniel-type criterion for hamiltonicity of a balanced bipartite digrap...
We describe a new type of sufficient condition for a balanced bipartitedigraph to be hamiltonian. Le...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
The first part of this paper deals with an extension of Dirac's Theorem to directed graphs. It is re...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
A Hamilton cycle in a graph is a cycle that passes through every vertex of the graph. A graph is cal...
DOI
Add to ORKG