We present a necessary and sufficient condition for existence of edge-disjoint contractible Hamiltonian Cycles in the edge graph of polyhedral maps
AbstractWe prove that a k-connected graph (k⩾2) is Hamiltonian if it is not contractible to one of a...
In this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Ham...
AbstractWe present a solution of two problems of P. Erdős on packing a set of r graphs into the comp...
In this paper we consider an approach to solve the problem of finding two edge-disjoint Hamiltonian ...
This paper is an exposition about the article written by Ferrara, Gould, Tansey and Whalen entitled ...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
AbstractChen (1988) conjectured that every finite hamiltonian Cayley graph is edge-hamiltonian. We p...
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 ...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
summary:In this note we show that deciding the existence of a Hamiltonian cycle in a cubic plane gra...
AbstractWe give necessary and sufficient conditions for a given graph embedded on the torus, to cont...
AbstractA necessary condition for the existence of a Hamiltonian cycle in split graphs is proved
We prove that if P is a set of at most 2n − 1 edges in a k-ary n-cube, where k ≥ 4 and n ≥ 2, then t...
AbstractWe prove that a k-connected graph (k⩾2) is Hamiltonian if it is not contractible to one of a...
In this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Ham...
AbstractWe present a solution of two problems of P. Erdős on packing a set of r graphs into the comp...
In this paper we consider an approach to solve the problem of finding two edge-disjoint Hamiltonian ...
This paper is an exposition about the article written by Ferrara, Gould, Tansey and Whalen entitled ...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
AbstractChen (1988) conjectured that every finite hamiltonian Cayley graph is edge-hamiltonian. We p...
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 ...
It is proved that a strong connected digraph D have two arc-disjoint Hamiltonian cycles if the respo...
[[abstract]]A Hamiltonian graph G is panpositionably Hamiltonian if for any two distinct vertices x ...
summary:In this note we show that deciding the existence of a Hamiltonian cycle in a cubic plane gra...
AbstractWe give necessary and sufficient conditions for a given graph embedded on the torus, to cont...
AbstractA necessary condition for the existence of a Hamiltonian cycle in split graphs is proved
We prove that if P is a set of at most 2n − 1 edges in a k-ary n-cube, where k ≥ 4 and n ≥ 2, then t...
AbstractWe prove that a k-connected graph (k⩾2) is Hamiltonian if it is not contractible to one of a...
In this paper, various properties of particular type of Hamiltonian graph and it’s edge-disjoint Ham...
AbstractWe present a solution of two problems of P. Erdős on packing a set of r graphs into the comp...