Pages that link to "Item:Q786830"
From MaRDI portal
The following pages link to The interval number of a planar graph: Three intervals suffice (Q786830):
Displaying 26 items.
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- Recognizing graphs with fixed interval number is NP-complete (Q760213) (← links)
- Tree loop graphs (Q876466) (← links)
- Three ways to cover a graph (Q898135) (← links)
- On the interval number of random graphs (Q923107) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- On star and caterpillar arboricity (Q1025569) (← links)
- A note on the interval number of a graph (Q1065014) (← links)
- Interval representations of planar graphs (Q1077425) (← links)
- On an extremal problem concerning the interval number of a graph (Q1084408) (← links)
- Irredundancy in multiple interval representations (Q1092070) (← links)
- The total interval number of a graph (Q1119605) (← links)
- On the unit interval number of a graph (Q1120600) (← links)
- On grid intersection graphs (Q1174140) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Interval numbers of powers of block graphs (Q1420587) (← links)
- On the planar split thickness of graphs (Q1742373) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- The interval number of a planar graph is at most three (Q2221918) (← links)
- Caterpillar arboricity of planar graphs (Q2370451) (← links)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- On the interval number of special graphs (Q4810499) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
