Pages that link to "Item:Q1262132"

The following pages link to A note on the Hamiltonian circuit problem on directed path graphs (Q1262132):

Displaying 6 items.

• The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs (Q2566023) (← links)
• The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)
• Intersection graphs of non-crossing paths (Q6041577) (← links)
• 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)