122 search results - page 10 / 25 » On pancyclism in hamiltonian graphs |
IJFCS
2007
13 years 7 months ago
2007
The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
DM
2008
13 years 7 months ago
2008
We show that the conjectures by Matthews and Sumner (every 4-connected claw-free graph is hamiltonian), by Thomassen (every 4-connected line graph is hamiltonian) and by Fleischne...
COMBINATORICS
2002
13 years 7 months ago
2002
The directed anti-Oberwolfach problem asks for a 2-factorization (each factor has in-degree 1 and out-degree 1 for a total degree of two) of K2n+1, not with consistent cycle compo...
SIAMDM
2010
13 years 5 months ago
2010
CSR
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. While thorough theoretical and experimental analyses have been ...