The following pages link to (Q4256006):
Displaying 10 items.
- Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Hamilton cycles in Euler tour graphs (Q1065826) (← links)
- The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
- Construction of Hamiltonian paths in graphs of permutation polyhedra (Q1956963) (← links)
- Hamiltonicity of digraphs for universal cycles of permutations (Q2493100) (← 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)
- Hamilton cycles in the union of random permutations (Q4761359) (← links)
- (Q4862336) (← links)
