Pages that link to "Item:Q1210553"

The following pages link to Paths in interval graphs and circular arc graphs (Q1210553):

Displaying 25 items.

• Hamiltonian paths in some classes of grid graphs (Q442933) (← links)
• An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← 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)
• Cyclability in graph classes (Q833007) (← links)
• Path partition for graphs with special blocks (Q1765521) (← links)
• The longest path problem is polynomial on cocomparability graphs (Q1939666) (← links)
• The 1-fixed-endpoint path cover problem is Polynomial on interval graphs (Q1957649) (← links)
• Parameterized complexity of \((A,\ell)\)-path packing (Q2118381) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
• A polynomial solution to the \(k\)-fixed-endpoint path cover problem on proper interval graphs (Q2268855) (← links)
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
• Disjoint path covers joining prescribed source and sink sets in interval graphs (Q2419125) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
• Solving the path cover problem on circular-arc graphs by using an approximation algorithm (Q2581561) (← links)
• On the Power of Graph Searching for Cocomparability Graphs (Q2801333) (← links)
• Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time (Q2840712) (← links)
• A Linear Time Algorithm for the 1-Fixed-Endpoint Path Cover Problem on Interval Graphs (Q2960472) (← 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)
• The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
• Kernelization of Graph Hamiltonicity: Proper $H$-Graphs (Q4986812) (← links)
• Linear‐Time Algorithms for Scattering Number and Hamilton‐Connectivity of Interval Graphs (Q5265335) (← links)