The I-graphs generalize the family of generalized Petersen graphs. We show that a connected I-graph which is not a generalized Petersen graph is Hamiltonian
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Euleri...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
AbstractThe uniform subset graph G(n, k, t) is defined to have all k-subsets of an n-set as vertices...
The I-graphs generalize the family of generalized Petersen graphs. We show that a connected I-graph ...
It is well known that the Petersen graph does not contain a Hamilton cycle. In 1983 Alspach complete...
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...
AbstractWatkins (J. Combinatorial Theory 6 (1969), 152–164) introduced the concept of generalized Pe...
AbstractAssume that n and k are positive integers with n≥2k+1. A non-Hamiltonian graph G is hypo-Ham...
In this paper, we prove that not all perfect matchings in Generalized Petersen graphs can be extende...
Coxeter referred to generalizing the Petersen graph. Zhou and Feng modified the graphs and introduce...
AbstractWe give a simpler proof of the theorem due to B. Jackson and Y. Zhu, Z. Liu, and Z. Yu that,...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
Robertson ([3]) and independently, Bondy ([1]) proved that the generalized Petersen graph P(n,2) is ...
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Euleri...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
AbstractThe uniform subset graph G(n, k, t) is defined to have all k-subsets of an n-set as vertices...
The I-graphs generalize the family of generalized Petersen graphs. We show that a connected I-graph ...
It is well known that the Petersen graph does not contain a Hamilton cycle. In 1983 Alspach complete...
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...
AbstractWatkins (J. Combinatorial Theory 6 (1969), 152–164) introduced the concept of generalized Pe...
AbstractAssume that n and k are positive integers with n≥2k+1. A non-Hamiltonian graph G is hypo-Ham...
In this paper, we prove that not all perfect matchings in Generalized Petersen graphs can be extende...
Coxeter referred to generalizing the Petersen graph. Zhou and Feng modified the graphs and introduce...
AbstractWe give a simpler proof of the theorem due to B. Jackson and Y. Zhu, Z. Liu, and Z. Yu that,...
AbstractLet G(itk, p) denote the class of k-partite graphs, where each part is a stable set of cardi...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
Robertson ([3]) and independently, Bondy ([1]) proved that the generalized Petersen graph P(n,2) is ...
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Euleri...
We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Pe...
AbstractThe uniform subset graph G(n, k, t) is defined to have all k-subsets of an n-set as vertices...
DOI
Add to ORKG