Pages that link to "Item:Q325435"
From MaRDI portal
The following pages link to Strictly interval graphs: characterization and linear time recognition (Q325435):
Displaying 9 items.
- Simple linear time recognition of unit interval graphs (Q672408) (← links)
- A linear time recognition algorithm for proper interval graphs (Q1014413) (← links)
- Vulnerability of subclasses of chordal graphs (Q1742199) (← links)
- The scattering number of strictly chordal graphs: linear time determination (Q2144221) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Realizing Interval Graphs with Size and Distance Constraints (Q4377452) (← links)
- ON THE HARDNESS OF RECOGNIZING BUNDLES IN TIME TABLE GRAPHS (Q5249051) (← links)
- A Polynomial Time Algorithm for Finding Linear Interval Graph Patterns (Q5425421) (← links)
- Recognizing interval bigraphs by forbidden patterns (Q6081553) (← links)