Add to ORKGThe first part of this paper deals with an extension of Dirac\u27s Theorem to directed graphs. It is related to a result often referred to as the Ghouila-Houri Theorem. Here we show that the requirement of being strongly connected in the hypothesis of the Ghouila-Houri Theorem is redundant. The Second part of the paper shows that a condition on the number of edges for a graph to be hamiltonian implies Ore\u27s condition on the degrees of the vertices
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractFor a simple graph G, let NCD(G)=min{|N(u)∪N(v)|+d(w):u,v,w∈V(G),uv⁄∈E(G),wvorwu⁄∈E(G)}. In ...
The first part of this paper deals with an extension of Dirac's Theorem to directed graphs. It is re...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
AbstractLet G be a graph, and δ(G) and α(G) be the minimum degree and the independence number of G, ...
AbstractThe purpose of this communication is to describe four new sufficient conditions for the exis...
AbstractIn this article we prove that a sufficient condition for an oriented strongly connected grap...
Let G be a simple graph of order n >= 3. Ore's classical theorem states that if d(x) + d(y) ...
(Statement of Responsibility) by Justin Paul Tienken-Harder(Thesis) Thesis (B.A.) -- New College o...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
AbstractIn Bang-Jensen et al. (Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theor...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractFor a simple graph G, let NCD(G)=min{|N(u)∪N(v)|+d(w):u,v,w∈V(G),uv⁄∈E(G),wvorwu⁄∈E(G)}. In ...
The first part of this paper deals with an extension of Dirac's Theorem to directed graphs. It is re...
We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this t...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
AbstractLet G be a graph, and δ(G) and α(G) be the minimum degree and the independence number of G, ...
AbstractThe purpose of this communication is to describe four new sufficient conditions for the exis...
AbstractIn this article we prove that a sufficient condition for an oriented strongly connected grap...
Let G be a simple graph of order n >= 3. Ore's classical theorem states that if d(x) + d(y) ...
(Statement of Responsibility) by Justin Paul Tienken-Harder(Thesis) Thesis (B.A.) -- New College o...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
AbstractIn Bang-Jensen et al. (Sufficient conditions for a digraph to be Hamiltonian, J. Graph Theor...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractWe obtain a sufficient condition for a digraph to be hamiltonian in terms of its connectivit...
AbstractA new sufficient condition for a graph to be Hamiltonian is given that does not require that...
AbstractFor a simple graph G, let NCD(G)=min{|N(u)∪N(v)|+d(w):u,v,w∈V(G),uv⁄∈E(G),wvorwu⁄∈E(G)}. In ...