114 search results - page 1 / 23 » An efficient condition for a graph to be Hamiltonian |
DAM
2007
13 years 4 months ago
2007
ARSCOM
2006
13 years 4 months ago
2006
Abstract. There are several well-known and important hamiltonian results for claw-free graphs but only a few are concerned with quasi-claw-free graphs. In this note, we provide a n...
DM
1999
13 years 4 months ago
1999
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
ARSCOM
2008
13 years 4 months ago
2008
COMBINATORICS
2006
13 years 4 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...