Let G be an undirected simple graph on \(n \geq 3\) vertices with the degree sum of any two nonadjacent vertices in G equal to \(n - 2\). We determine the condition for G to be a Hamiltonian graph
AbstractLet G be a graph of order n, σk = min{ϵi=1kd(νi): {ν1,…, νk} is an independent set of vertic...
Given a 2-connected graph G on n vertices, let G* be its partially square graph, obtained by adding ...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
AbstractLet G be a graph, and δ(G) and α(G) be the minimum degree and the independence number of G, ...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
Let G be a simple graph of order n >= 3. Ore's classical theorem states that if d(x) + d(y) ...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractLet G be a 2-connected claw-free graph on n vertices. Let σk(G) be the minimum degree sum am...
AbstractThe purpose of this communication is to describe four new sufficient conditions for the exis...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
AbstractWe give a sufficient condition for hamiltonism of a 2-connected graph involving the degree s...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
Using a variation of the Bondy-Chvátal closure theorem the following result is proved: If G is a 2-c...
AbstractWe survey results and open problems in hamiltonian graph theory centered around three themes...
AbstractLet G be a graph of order n, σk = min{ϵi=1kd(νi): {ν1,…, νk} is an independent set of vertic...
Given a 2-connected graph G on n vertices, let G* be its partially square graph, obtained by adding ...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
AbstractLet G be a graph, and δ(G) and α(G) be the minimum degree and the independence number of G, ...
A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph is Hamilt...
Let G be a simple graph of order n >= 3. Ore's classical theorem states that if d(x) + d(y) ...
AbstractSince finding whether a graph has a Hamiltonian path or Hamiltonian cycle are both NP-comple...
AbstractIn 2005, Rahman and Kaykobad introduced the Rahman-Kaykobad condition for the research of Ha...
AbstractLet G be a 2-connected claw-free graph on n vertices. Let σk(G) be the minimum degree sum am...
AbstractThe purpose of this communication is to describe four new sufficient conditions for the exis...
We study graph theory. A graph is composed by a vertex set and an edge set, and each edge joins an u...
AbstractWe give a sufficient condition for hamiltonism of a 2-connected graph involving the degree s...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
Using a variation of the Bondy-Chvátal closure theorem the following result is proved: If G is a 2-c...
AbstractWe survey results and open problems in hamiltonian graph theory centered around three themes...
AbstractLet G be a graph of order n, σk = min{ϵi=1kd(νi): {ν1,…, νk} is an independent set of vertic...
Given a 2-connected graph G on n vertices, let G* be its partially square graph, obtained by adding ...
AbstractA theorem is proved that is (in a sense) the best possible improvement on the following them...
DOI
Add to ORKG