We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is most useful in the case when it induces a blue and red 2-factorization of the associated quartic graph. We use this condition to characterize the Hamiltonian I-graphs, a further generalization of generalized Petersen graphs. The characterization of Hamiltonian I-graphs follows from the fact that one can choose a 1-factor in any I-graph in such a way that the corresponding associated quartic graph is a graph bundle having a cycle graph as base graph and a fiber and the fundamental factorization of graph bu...
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
A Hamiltonian cycle in a connected graph G is defined as a closed walk that traverses every vertex o...
Assume G is a finite group, such that |G| is either 6pq or 7pq, where p and q are distinct prime num...
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Euleri...
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Euleri...
It is well known that the Petersen graph does not contain a Hamilton cycle. In 1983 Alspach complete...
A Hamiltonian walk in a connected graph G of order n is a closed spanning walk of minimum length in ...
The I-graphs generalize the family of generalized Petersen graphs. We show that a connected I-graph ...
AbstractIt is proven that every connected Cayley graph X, of valency at least three, on a Hamiltonia...
V článku charakterizujeme kubické Cayleyho grafy obvodu nejvíce 6. Zároveň zkoumáme jejich hamiltoni...
AbstractThe generalized Petersen graph GP(n, k), n ≥ 2 and 1 ≤ k ≤ n − 1, has vertex-set {u0, u1,…, ...
In 1969 Lászlo Lovász posed a question whether every connected vertex-transitive graph has a Hamilto...
The generalized Petersen graph G(n, k), 1≤k≤n−1, is defined as follows: The graph G(n, k) has vertic...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
AbstractThe generalized Petersen graph P(n, k) has vertex set V={u0, u1, …, un−1, v0, v1, …, vn−1} a...
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
A Hamiltonian cycle in a connected graph G is defined as a closed walk that traverses every vertex o...
Assume G is a finite group, such that |G| is either 6pq or 7pq, where p and q are distinct prime num...
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Euleri...
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Euleri...
It is well known that the Petersen graph does not contain a Hamilton cycle. In 1983 Alspach complete...
A Hamiltonian walk in a connected graph G of order n is a closed spanning walk of minimum length in ...
The I-graphs generalize the family of generalized Petersen graphs. We show that a connected I-graph ...
AbstractIt is proven that every connected Cayley graph X, of valency at least three, on a Hamiltonia...
V článku charakterizujeme kubické Cayleyho grafy obvodu nejvíce 6. Zároveň zkoumáme jejich hamiltoni...
AbstractThe generalized Petersen graph GP(n, k), n ≥ 2 and 1 ≤ k ≤ n − 1, has vertex-set {u0, u1,…, ...
In 1969 Lászlo Lovász posed a question whether every connected vertex-transitive graph has a Hamilto...
The generalized Petersen graph G(n, k), 1≤k≤n−1, is defined as follows: The graph G(n, k) has vertic...
In 1857, the Irish mathematician Sir William Hamilton(1805-1865) invented a game of travelling aroun...
AbstractThe generalized Petersen graph P(n, k) has vertex set V={u0, u1, …, un−1, v0, v1, …, vn−1} a...
A Hamilton cycle is a cycle which passes through every vertex of a graph. A Hamilton cycle decomposi...
A Hamiltonian cycle in a connected graph G is defined as a closed walk that traverses every vertex o...
Assume G is a finite group, such that |G| is either 6pq or 7pq, where p and q are distinct prime num...