On double and multiple interval graphs

DOI10.1002/JGT.3190030302MaRDI QIDQ3206997zbMATH OpenOpenAlexFDO

Authors William T. 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

zbMATH Keywords

allocation problemscomplete bipartite graphinterval graphinterval numberscheduling problemstree

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• Incidence matrices and interval graphs

Cited in

(52)

• Determining the interval number of a triangle-free graph
• 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
• On an extremal problem concerning the interval number of a graph
• Irredundancy in multiple interval representations
• Hamiltonian circuits in interval graph generalizations
• On the unit interval number of a graph
• A characterization of Robert's inequality for boxicity
• Extremal values of the interval number of a graph. II
• Extremal values of the interval number of a graph, II
• Representations of graphs and networks (coding, layouts and embeddings)
• Clique tree generalization and new subclasses of chordal graphs
• Interval numbers of powers of block graphs
• Total interval numbers of complete \(r\)-partite graphs
• Precedence thinness in graphs
• Cyclic arrangements with minimum modulo \(m\) winding numbers
• Scheduling split intervals with non-uniform demands
• The interval number of a planar graph is at most three
• The maximum clique problem in multiple interval graphs
• Recognizing d-interval graphs and d-track interval graphs
• Edge-intersection graphs of grid paths: the bend-number
• Extracting constrained 2-interval subsets in 2-interval sets
• k-separator chordal graphs: leafage and subfamilies
• Counting Interval Graphs
• Extremal Values of the Interval Number of a Graph
• On the interval number of special graphs
• Determining DNA sequence similarity using maximum independent set algorithms for interval graphs
• Hydras: directed hypergraphs and Horn formulas
• Gallai-type results for multiple boxes and forests
• On the parameterized complexity of some optimization problems related to multiple-interval graphs
• Splitting plane graphs to outerplanarity
• Splitting plane graphs to outerplanarity
• Recognizing unit multiple interval graphs is hard
• Interview with Douglas West
• The total interval number of a tree and the Hamiltonian completion number of its line graph
• Recognizing unit multiple intervals is hard
• Veto interval graphs and variations
• Generalizing Roberts' characterization of unit interval graphs
• On the complexity of vertex-splitting into an interval graph
• 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
• The interval number of a complete multipartite graph
• Tolerance graphs
• Complexity issues in color-preserving graph embeddings
• Tree loop graphs
• Three ways to cover a graph
• On the interval number of random graphs
• Approximating the 2-interval pattern problem

This page was built for publication: On double and multiple interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206997)