Pages that link to "Item:Q3964599"
From MaRDI portal
The following pages link to Extremal Values of the Interval Number of a Graph (Q3964599):
Displaying 43 items.
- Approximation algorithms for intersection graphs (Q476425) (← links)
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- Optimization problems in multiple subtree graphs (Q531599) (← links)
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- The total interval number of a tree and the Hamiltonian completion number of its line graph (Q672831) (← links)
- The total interval number of a graph. I: Fundamental classes (Q685584) (← links)
- Subtree and substar intersection numbers (Q686262) (← links)
- Recognizing graphs with fixed interval number is NP-complete (Q760213) (← links)
- The interval number of a planar graph: Three intervals suffice (Q786830) (← links)
- Some results about the interval number of a graph (Q788005) (← links)
- A lower bound for the interval number of a graph (Q788751) (← links)
- The interval number of a complete multipartite graph (Q792347) (← links)
- Tolerance graphs (Q798675) (← links)
- Three ways to cover a graph (Q898135) (← links)
- On the interval number of random graphs (Q923107) (← links)
- Approximating the 2-interval pattern problem (Q932323) (← links)
- On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
- On the cubicity of certain graphs (Q1041732) (← links)
- Determining the interval number of a triangle-free graph (Q1052345) (← links)
- Covering and coloring problems for relatives of intervals (Q1061132) (← links)
- A note on the interval number of a graph (Q1065014) (← links)
- Irrepresentability by multiple intersection, or why the interval number is unbounded (Q1065021) (← links)
- On an extremal problem concerning the interval number of a graph (Q1084408) (← links)
- Irredundancy in multiple interval representations (Q1092070) (← links)
- Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
- A short proof of the degree bound for interval number (Q1114708) (← links)
- The total interval number of a graph (Q1119605) (← links)
- On the unit interval number of a graph (Q1120600) (← links)
- Extremal values of the interval number of a graph. II (Q1145706) (← links)
- Extremal values of the interval number of a graph, II (Q1149452) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- Interval numbers of powers of block graphs (Q1420587) (← links)
- Total interval numbers of complete \(r\)-partite graphs (Q1613415) (← links)
- Interval number of special posets and random posets (Q1898344) (← links)
- On the complexity of the smallest grammar problem over fixed alphabets (Q2035481) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Clique coverings of the edges of a random graph (Q2367438) (← links)
- Recognizing \(d\)-interval graphs and \(d\)-track interval graphs (Q2375953) (← links)
- Edge-intersection graphs of grid paths: the bend-number (Q2440108) (← links)
- Extracting constrained 2-interval subsets in 2-interval sets (Q2456375) (← links)
- Counting Interval Graphs (Q3669449) (← links)
- Supereulerian graphs: A survey (Q4013420) (← links)
