AbstractWe prove that if a graph G on n ⩾ 32 vertices is hamiltonian and has two nonadjacent vertices u and v with d(u) + d(v) ⩾ n + z where z = 0 if n is odd and z = 1 if n is even, then G contains all cycles of length m where 3 ⩽ m ⩽ 15(n + 13)
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
Abstract. Let G = (X, Y) be a bipartite graph and define σ22(G) = min{d(x) + d(y) : xy /∈ E(G), x ∈...
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least 4 7(m − n) ...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
AbstractLet k and s be integers, 1 ≤ s ≤ 4. Let G be a graph whose vertices have degrees between k a...
AbstractLet k and s be integers, 1 ≤ s ≤ 4. Let G be a graph whose vertices have degrees between k a...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
The Erdős-Gyárfás conjecture (EGC) states that every graph with minimum vertex degree of at least 3 ...
We prove that every Hamiltonian graph with n vertices and m edges has cycles with more than p − 12 l...
This chapter presents the theorem of Hamiltonian cycles in regular graphs. If in a graph of order n ...
AbstractLet G be a subgraph of K(n), the complete graph on n vertices, such that (i) its edges canno...
Let G be a graph of order n ≥ 3. An even squared hamiltonian cycle (ESHC) of G is a hamiltonian cycl...
AbstractLet G be a graph of order n≥3. An even squared Hamiltonian cycle (ESHC) of G is a Hamiltonia...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
Abstract. Let G = (X, Y) be a bipartite graph and define σ22(G) = min{d(x) + d(y) : xy /∈ E(G), x ∈...
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least 4 7(m − n) ...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
AbstractLet k and s be integers, 1 ≤ s ≤ 4. Let G be a graph whose vertices have degrees between k a...
AbstractLet k and s be integers, 1 ≤ s ≤ 4. Let G be a graph whose vertices have degrees between k a...
AbstractWe prove that every Hamiltonian graph with n vertices and m edges has cycles with more than ...
AbstractWe study the set of cycle lengths in a hamiltonian graph G of order n with two fixed and non...
The Erdős-Gyárfás conjecture (EGC) states that every graph with minimum vertex degree of at least 3 ...
We prove that every Hamiltonian graph with n vertices and m edges has cycles with more than p − 12 l...
This chapter presents the theorem of Hamiltonian cycles in regular graphs. If in a graph of order n ...
AbstractLet G be a subgraph of K(n), the complete graph on n vertices, such that (i) its edges canno...
Let G be a graph of order n ≥ 3. An even squared hamiltonian cycle (ESHC) of G is a hamiltonian cycl...
AbstractLet G be a graph of order n≥3. An even squared Hamiltonian cycle (ESHC) of G is a Hamiltonia...
DeLeon 1 A graph G is Hamiltonian if it has a spanning cycle. The problem of determining if a graph ...
AbstractA graph G is pancyclic if it contains a k-cycle for k = 3,4,…,|V(G)|. In this paper we show ...
Abstract. Let G = (X, Y) be a bipartite graph and define σ22(G) = min{d(x) + d(y) : xy /∈ E(G), x ∈...
We prove that every Hamiltonian graph with n vertices and m edges has cycles of at least 4 7(m − n) ...
DOI
Add to ORKG