Pages that link to "Item:Q2227488"

The following pages link to The longest cycle problem is polynomial on interval graphs (Q2227488):

Displaying 10 items.

• The longest path problem has a polynomial solution on interval graphs (Q639287) (← links)
• Finding the longest isometric cycle in a graph (Q967311) (← links)
• A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
• Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs (Q2402262) (← links)
• Computing and counting longest paths on circular-arc graphs in polynomial time (Q2448873) (← links)
• Polynomial Fixed-parameter Algorithms: A Case Study for Longest Path on Interval Graphs (Q5363764) (← links)
• Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q6167020) (← links)
• The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
• Semi-proper interval graphs (Q6648246) (← links)