CORR
2011
Springer
12 years 8 months ago
2011
Springer
It is shown that there are examples of distinct polyhedra, each with a Hamiltonian path of edges, which when cut, unfolds the surfaces to a common net. In particular, it is establ...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
We show that four of the five Platonic solids’ surfaces may be cut open with a Hamiltonian path along edges and unfolded to a polygonal net each of which can “zipper-refold...
DM
2007
13 years 4 months ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
DM
2010
13 years 4 months ago
2010
We say that a hypergraph H is hamiltonian path (cycle) saturated if H does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) ham...