Add to ORKGThis paper is an exposition about the article written by Ferrara, Gould, Tansey and Whalen entitled Disjoint hamiltonian cycles in bipartite graphs which appeared on Discrete Mathematics vol. 309 (2009). Basic concepts and proofs of some theorems and lemmas were presented. The authors focused on the proof that for any balanced bipartite with sufficiently large number of vertices, its degree-sum ensures the existence of k edge-disjoint hamiltonian cycles. In this paper, we study proofs and conditions that are needed in order to produce k systems of edge-disjoint paths and show that they can be extended to k edge-disjoint hamiltonian cycles
We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large mini...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
A cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident with at l...
AbstractLet G=(X,Y) be a bipartite graph and define σ22(G)=min{d(x)+d(y):xy∉E(G),x∈X,y∈Y}. Moon and ...
Abstract. Let G = (X, Y) be a bipartite graph and define σ22(G) = min{d(x) + d(y) : xy /∈ E(G), x ∈...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
AbstractLet G=(X,Y) be a bipartite graph and define σ22(G)=min{d(x)+d(y):xy∉E(G),x∈X,y∈Y}. Moon and ...
Abstract We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
In this paper we consider an approach to solve the problem of finding two edge-disjoint Hamiltonian ...
We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamilton...
AbstractLet Kn,n be the complete bipartite graph of order 2n. Two players, maker and breaker, altern...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
In this thesis, we will discuss existence of hamiltonian cycles in Kneser graphs: graphs K(n,k) with...
We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large mini...
We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large mini...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
A cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident with at l...
AbstractLet G=(X,Y) be a bipartite graph and define σ22(G)=min{d(x)+d(y):xy∉E(G),x∈X,y∈Y}. Moon and ...
Abstract. Let G = (X, Y) be a bipartite graph and define σ22(G) = min{d(x) + d(y) : xy /∈ E(G), x ∈...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
AbstractLet G=(X,Y) be a bipartite graph and define σ22(G)=min{d(x)+d(y):xy∉E(G),x∈X,y∈Y}. Moon and ...
Abstract We give a sufficient condition for a simple graph G to have k pairwise edge-disjoint cycles...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
In this paper we consider an approach to solve the problem of finding two edge-disjoint Hamiltonian ...
We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamilton...
AbstractLet Kn,n be the complete bipartite graph of order 2n. Two players, maker and breaker, altern...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
In this thesis, we will discuss existence of hamiltonian cycles in Kneser graphs: graphs K(n,k) with...
We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large mini...
We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large mini...
AbstractIn 1960 Ore proved the following theorem: Let G be a graph of order n. If d(u)+d(v)⩾n for ev...
A cycle C of a graph G is called dominating cycle (D-cycle) if every edge of G is incident with at l...