Pages that link to "Item:Q2227488"
From MaRDI portal
The following pages link to The longest cycle problem is polynomial on interval graphs (Q2227488):
Displaying 4 items.
- 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)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
- Semi-proper interval graphs (Q6648246) (← links)
