Pages that link to "Item:Q1823687"

The following pages link to The Hamiltonian circuit problem for circle graphs is NP-complete (Q1823687):

Displaying 22 items.

• Hamiltonian cycles in linear-convex supergrid graphs (Q335338) (← links)
• The Hamiltonian properties of supergrid graphs (Q497690) (← links)
• 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)
• The Hamiltonian connectivity of rectangular supergrid graphs (Q1751246) (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• Revising Johnson's table for the 21st century (Q2091799) (← links)
• Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
• A linear-time algorithm for finding Hamiltonian \((s,t)\)-paths in even-sized rectangular grid graphs with a rectangular hole (Q2399614) (← links)
• Lower bounds on the mim-width of some graph classes (Q2413964) (← links)
• Parameterized domination in circle graphs (Q2441539) (← 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)
• (Q5116474) (← links)
• Leaf sector covers with applications on circle graphs (Q6549679) (← links)
• Graphs of intersections of closed polygonal chains (Q6669632) (← links)