122 search results - page 3 / 25 » On pancyclism in hamiltonian graphs |
ARSCOM
2008
13 years 6 months ago
2008
COMBINATORICS
2006
13 years 6 months ago
2006
A simple, undirected 2-connected graph G of order n belongs to class O(n,), 0, if 2 = n - . It is well known (Ore's theorem) that G is hamiltonian if = 0, in which case the 2...
DAM
2000
13 years 6 months ago
2000
Thomassen (J. Combin. Theory Ser. B 28, 1980, 142
DM
2008
13 years 6 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian), if for any sequence of k distinct vertices v1, . . . , vk of G there exists a cycle (respectively, hamiltonian...
DM
2008
13 years 6 months ago
2008
A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v1, . . . , vk of G, there exists a cycle (respectively, a hamilton...