122 search results - page 19 / 25 » On pancyclism in hamiltonian graphs |
FUN
2007
Springer
13 years 11 months ago
2007
Springer
Architectures for optical processors designed to solve bounded instances of NP-Complete problems are suggested. One approach mimics the traveling salesman by traveling beams that ...
CONSTRAINTS
2008
13 years 7 months ago
2008
The tree constraint partitions a directed graph into node-disjoint trees. In many practical applications that involve such a partition, there exist side constraints specifying requ...
AI
2005
Springer
13 years 7 months ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
ISW
2004
Springer
14 years 23 days ago
2004
Springer
The ICAT statistics over the past few years have shown at least one out of every five CVE and CVE candidate vulnerabilities have been due to buffer overflows. This constitutes a si...
COMBINATORICS
1999
13 years 7 months ago
1999
![A [k, k+1]-Factor Containing A Given Hamiltonian Cycle](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/a_k_k_1_factor_containing_a_given_hamiltonian_cycle_COMBINATORICS_1999.jpg "A [k, k+1]-Factor Containing A Given Hamiltonian Cycle")
We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k - 16 for even n and n 6k-13 for odd n...