Pages that link to "Item:Q1149452"
From MaRDI portal
The following pages link to Extremal values of the interval number of a graph, II (Q1149452):
Displaying 10 items.
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
- The interval number of a planar graph: Three intervals suffice (Q786830) (← links)
- A lower bound for the interval number of a graph (Q788751) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- Determining the interval number of a triangle-free graph (Q1052345) (← links)
- The total interval number of a graph (Q1119605) (← links)
- Clique coverings of the edges of a random graph (Q2367438) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Extremal Values of the Interval Number of a Graph (Q3964599) (← links)