AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the tensor product of graphs. The relationship between the bieulerian orientation of a 4-regular graph G and the existence of a pair of edge-disjoint Hamilton cycles in G⊗K2 is established. Also a characterization for a 4-regular graph to have a bieulerian orientation is presented. Finally, some conjectures of Jha relating to the existence of cycles or edge-disjoint Hamilton cycles are either proved or disproved
Most network topologies that have been studied have been subgraphs of transposition graphs. Edge-dis...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Wil...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
International audienceIn this paper we show that the tensor product of complete graphs is hamilton c...
AbstractWe give a necessary and sufficient condition for the Hamiltonicity of the cross product of t...
AbstractIn this paper we define the Euler tour graph of an Eulerina graph by K-transformations, whic...
AbstractWe prove that every edge in a 5-connected graph embedded in the torus is contained in a Hami...
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
AbstractTutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and ...
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 ...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
In 1975, Sheehan conjectured that every simple 4-regular hamiltonian graph has a second Hamilton cyc...
Most network topologies that have been studied have been subgraphs of transposition graphs. Edge-dis...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Wil...
AbstractIn this paper, we characterize graphs G for which G⊗K2 is Hamiltonian, where ⊗ denotes the t...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
International audienceIn this paper we show that the tensor product of complete graphs is hamilton c...
AbstractWe give a necessary and sufficient condition for the Hamiltonicity of the cross product of t...
AbstractIn this paper we define the Euler tour graph of an Eulerina graph by K-transformations, whic...
AbstractWe prove that every edge in a 5-connected graph embedded in the torus is contained in a Hami...
A circuit is a connected 2-regular graph. A cycle is a graph such that the degree of each vertex is ...
AbstractIn this paper, it is shown that the tensor product of the complete bipartite graph, Kr,r,r≥2...
AbstractTutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and ...
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 ...
The purpose of this thesis is to examine the number of edge-disjoint Hamiltonian cycles in de Bruijn...
In 1975, Sheehan conjectured that every simple 4-regular hamiltonian graph has a second Hamilton cyc...
Most network topologies that have been studied have been subgraphs of transposition graphs. Edge-dis...
AbstractWe survey some recent results on long-standing conjectures regarding Hamilton cycles in dire...
Tutte has shown that every 4-connected planar graph contains a Hamilton cycle. Grünbaum and Nash-Wil...