Pages that link to "Item:Q4302282"
From MaRDI portal
The following pages link to Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs (Q4302282):
Displayed 15 items.
- Hamiltonian properties of locally connected graphs with bounded vertex degree (Q643015) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Finding Hamiltonian circuits in quasi-adjoint graphs (Q955323) (← links)
- Partial and perfect path covers of cographs (Q1281391) (← links)
- Hamiltonian powers in threshold and arborescent comparability graphs (Q1301703) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- HAMILTONian circuits in chordal bipartite graphs (Q1923528) (← 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)
- Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
- The Longest Path Problem is Polynomial on Cocomparability Graphs (Q3057610) (← links)