Pages that link to "Item:Q1823687"
From MaRDI portal
The following pages link to The Hamiltonian circuit problem for circle graphs is NP-complete (Q1823687):
Displayed 10 items.
- The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
- An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- Paths in interval graphs and circular arc graphs (Q1210553) (← links)
- Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← 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)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- The Longest Path Problem Is Polynomial on Interval Graphs (Q3182942) (← links)