Hamiltonian Sets of Polygonal Paths in Assembly Graphs

A. Guterman, N. Jonoska, E. Kreines +2

We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltoni…