122 search results - page 17 / 25 » On pancyclism in hamiltonian graphs |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
DM
2000
13 years 7 months ago
2000
The graph G(N; d) has vertex set V = {0; 1; : : : ; N - 1}, with {v; w} an edge if v - w
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 ...
WG
2009
Springer
14 years 2 months ago
2009
Springer
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our...
SIAMDM
2000
13 years 7 months ago
2000
We establish that every cyclically 4-connected cubic planar graph of order at most 40 is hamiltonian. Furthermore, this bound is determined to be sharp and we present all nonhamil...