Pages that link to "Item:Q685527"

The following pages link to Polynomial time algorithms for Hamiltonian problems on bipartite distance-hereditary graphs (Q685527):

Displaying 7 items.

• A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
• HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← links)
• Some algorithmic results on Hamiltonicity and its variants in \(P_6\)-free graphs (Q2093879) (← links)
• Equistable distance-hereditary graphs (Q2473043) (← links)
• The Hamiltonian problem on distance-hereditary graphs (Q2489947) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs (Q4242916) (← links)