On double and multiple interval graphs
From MaRDI portal
Publication:3206997
DOI10.1002/jgt.3190030302zbMath0417.05050OpenAlexW2112631288MaRDI QIDQ3206997
William T. jun. Trotter, Frank Harary
Publication date: 1979
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190030302
Related Items
Total interval numbers of complete \(r\)-partite graphs, Extremal Values of the Interval Number of a Graph, On an extremal problem concerning the interval number of a graph, Irredundancy in multiple interval representations, Hamiltonian circuits in interval graph generalizations, Recognizing \(d\)-interval graphs and \(d\)-track interval graphs, Determining DNA sequence similarity using maximum independent set algorithms for interval graphs, Clique tree generalization and new subclasses of chordal graphs, Complexity issues in color-preserving graph embeddings, On the interval number of special graphs, On the unit interval number of a graph, Tree loop graphs, On the parameterized complexity of some optimization problems related to multiple-interval graphs, A characterization of Robert's inequality for boxicity, Splitting plane graphs to outerplanarity, Three ways to cover a graph, Extremal values of the interval number of a graph. II, Extremal values of the interval number of a graph, II, Counting Interval Graphs, Edge-intersection graphs of grid paths: the bend-number, Interval numbers of powers of block graphs, On the interval number of random graphs, Scheduling split intervals with non-uniform demands, The interval number of a planar graph is at most three, Representations of graphs and networks (coding, layouts and embeddings), On the bend-number of planar and outerplanar graphs, Approximating the 2-interval pattern problem, Extracting constrained 2-interval subsets in 2-interval sets, The total interval number of a tree and the Hamiltonian completion number of its line graph, Hydras: directed hypergraphs and Horn formulas, Gallai-type results for multiple boxes and forests, Recognizing graphs with fixed interval number is NP-complete, The interval number of a planar graph: Three intervals suffice, Some results about the interval number of a graph, A lower bound for the interval number of a graph, Determining the interval number of a triangle-free graph, Precedence thinness in graphs, The interval number of a complete multipartite graph, k-separator chordal graphs: leafage and subfamilies, Tolerance graphs, On the chromatic number of multiple interval graphs and overlap graphs, Covering and coloring problems for relatives of intervals, A note on the interval number of a graph, Irrepresentability by multiple intersection, or why the interval number is unbounded, The maximum clique problem in multiple interval graphs, Cyclic arrangements with minimum modulo \(m\) winding numbers
Cites Work
