Pages that link to "Item:Q4027864"

The following pages link to An $O(n^2 \log n)$ Algorithm for the Hamiltonian Cycle Problem on Circular-Arc Graphs (Q4027864):

Displaying 20 items.

• Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs (Q628259) (← links)
• Efficient parallel recognition of some circular arc graphs. II (Q675297) (← links)
• An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs (Q719277) (← links)
• A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
• The path-partition problem in block graphs (Q1342260) (← links)
• Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
• 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
• \(k\)-path partitions in trees (Q1377668) (← links)
• Jump number maximization for proper interval graphs and series-parallel graphs (Q1818782) (← links)
• Revising Johnson's table for the 21st century (Q2091799) (← links)
• Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← 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)
• Hamiltonicity in Split Graphs - A Dichotomy (Q2971662) (← links)
• Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)
• Hamiltonian Cycle in K1,r-Free Split Graphs — A Dichotomy (Q6114853) (← links)
• 2-Trees: Structural insights and the study of Hamiltonian paths (Q6132868) (← links)
• Connected proper interval graphs and the guard problem in spiral polygons (extended abstract) (Q6567668) (← links)