The following pages link to (Q4281626):
Displaying 12 items.
- An optimal algorithm for the \(k\)-fixed-endpoint path cover on proper interval graphs (Q626964) (← links)
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Satisfiability problems on intervals and unit intervals (Q1392209) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- Quasi-threshold graphs (Q1923584) (← links)
- A type of algebraic structure related to sets of intervals (Q2088070) (← links)
- Chronological rectangle digraphs which are two-terminal series-parallel (Q2414469) (← links)
- Characterizing interval graphs which are probe unit interval graphs (Q2416421) (← links)
- A matrix characterization of interval and proper interval graphs (Q2483137) (← links)
- A polynomial algorithm for the k-cluster problem on the interval graphs (Q3439650) (← links)
- The Perfect Matching Reconfiguration Problem (Q5092444) (← links)
