122 search results - page 15 / 25 » On pancyclism in hamiltonian graphs |
IEEECIT
2009
IEEE
13 years 5 months ago
2009
IEEE
Recursive Dual-Net (RDN) was proposed recently as an effective, high-performance interconnection network for supercomputers with millions of nodes. A Recursive DualNet RDN(B) is r...
COCOON
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
JGT
2010
13 years 5 months ago
2010
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we...
DM
1999
13 years 7 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...
DM
2008
13 years 7 months ago
2008
Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria f...