Pages that link to "Item:Q2375953"
From MaRDI portal
The following pages link to Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953):
Displaying 8 items.
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Trees, paths, stars, caterpillars and spiders (Q1635718) (← links)
- Precedence thinness in graphs (Q2091785) (← links)
- The interval number of a planar graph is at most three (Q2221918) (← links)
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review (Q2327955) (← links)
- Trees, Paths, Stars, Caterpillars and Spiders (Q3467870) (← links)
- On interval representations of graphs (Q5962513) (← links)
- A graph-theoretic barcode ordering model for linked-reads (Q6487642) (← links)
