42 search results - page 6 / 9 » Hamilton cycles in prisms |
IPPS
2003
IEEE
14 years 1 months ago
2003
IEEE
The dual-cube is a newly proposed topology for interconnection networks, which uses low dimensional hypercubes as building blocks. The primary advantages of the dual-cube over the...
COCOON
2007
Springer
14 years 2 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
2006
13 years 8 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...
JAIR
1998
13 years 8 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...
COMBINATORICS
2007
13 years 8 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...