Pages that link to "Item:Q3206997"

The following pages link to On double and multiple interval graphs (Q3206997):

Displaying 45 items.

• On the bend-number of planar and outerplanar graphs (Q477341) (← links)
• Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
• Gallai-type results for multiple boxes and forests (Q583206) (← 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)
• 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)
• Complexity issues in color-preserving graph embeddings (Q846361) (← links)
• Tree loop graphs (Q876466) (← 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)
• Determining the interval number of a triangle-free graph (Q1052345) (← links)
• On the chromatic number of multiple interval graphs and overlap graphs (Q1061131) (← 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)
• On the unit interval number of a graph (Q1120600) (← links)
• A characterization of Robert's inequality for boxicity (Q1132899) (← 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)
• Clique tree generalization and new subclasses of chordal graphs (Q1348383) (← links)
• Interval numbers of powers of block graphs (Q1420587) (← links)
• Total interval numbers of complete \(r\)-partite graphs (Q1613415) (← links)
• Precedence thinness in graphs (Q2091785) (← links)
• Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
• Scheduling split intervals with non-uniform demands (Q2218651) (← links)
• The interval number of a planar graph is at most three (Q2221918) (← links)
• The maximum clique problem in multiple interval graphs (Q2350898) (← 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)
• <i>k</i>-separator chordal graphs: leafage and subfamilies (Q2862158) (← links)
• Counting Interval Graphs (Q3669449) (← links)
• Extremal Values of the Interval Number of a Graph (Q3964599) (← links)
• On the interval number of special graphs (Q4810499) (← links)
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs (Q5056152) (← links)