A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Mutually Independent Hamiltonian Cycle of Burnt Pancake Graphs
2011
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Preserved Fulltext
Hamiltonian cycle of G is a cycle contains every vertex in G. Two Hamiltonian cycles
doi:10.1587/transfun.e94.a.1553
fatcat:osbgwvxcafhb7n2evztskfppxi