The following pages link to (Q4862336):
Displaying 5 items.
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Construction of Hamiltonian paths in graphs of permutation polyhedra (Q1956963) (← links)
- The maximum clique problem for permutation Hamming graphs (Q2156387) (← links)
- Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
