Pages that link to "Item:Q491160"
From MaRDI portal
The following pages link to Interval graph representation with given interval and intersection lengths (Q491160):
Displaying 12 items.
- On the isomorphism problem for Helly circular-arc graphs (Q259081) (← links)
- Recognizing graphs with fixed interval number is NP-complete (Q760213) (← links)
- Graphs of interval count two with a given partition (Q2015148) (← links)
- Dimension of restricted classes of interval orders (Q2163840) (← links)
- Stick graphs with length constraints (Q2206824) (← links)
- On interval graphs and matrice profiles (Q3744204) (← links)
- Recognizing Stick Graphs with and without Length Constraints (Q5141646) (← links)
- FO Model Checking of Interval Graphs (Q5327438) (← links)
- Overlaying a hypergraph with a graph with bounded maximum degree (Q5918772) (← links)
- Parameterized complexity of perfectly matched sets (Q6038698) (← links)
- Interval graphs with side (and size) constraints (Q6102297) (← links)
- A graph-theoretic barcode ordering model for linked-reads (Q6487642) (← links)