48 search results - page 3 / 10 » The Hamiltonian problem on distance-hereditary graphs |
GC
2007
Springer
13 years 7 months ago
2007
Springer
For an integer k > 0, a graph G is k-triangular if every edge of G lies in at least k distinct 3-cycles of G. In (J Graph Theory 11:399–407 (1987)), Broersma and Veldman propo...
JAIR
1998
13 years 7 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
MFCS
2009
Springer
14 years 1 months ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
MPC
1998
Springer
13 years 11 months ago
1998
Springer
DAM
2006
13 years 7 months ago
2006