This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
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...
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�...
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 ...
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...