The following pages link to Jan Arne Telle (Q300478):
Displaying 5 items.
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Leaf Powers and Their Properties: Using the Trees (Q3596736) (← links)
- Interval Completion Is Fixed Parameter Tractable (Q3642873) (← links)
- Algorithms for Vertex Partitioning Problems on Partial k-Trees (Q4377448) (← links)
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems (Q5458528) (← links)
