Results 271 to 280 of about 157,845 (305)
Some of the next articles are maybe not open access.
Recognizing d-Interval Graphs and d-Track Interval Graphs
Algorithmica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Random Structures and Algorithms, 1998
Summary: We consider models for random interval graphs that are based on stochastic service systems, with vertices corresponding to customers and edges corresponding to pairs of customers that are in the system simultaneously. The number \(N\) of vertices in a connected component thus corresponds to the number of customers arriving during a busy period,
openaire +2 more sources
Summary: We consider models for random interval graphs that are based on stochastic service systems, with vertices corresponding to customers and edges corresponding to pairs of customers that are in the system simultaneously. The number \(N\) of vertices in a connected component thus corresponds to the number of customers arriving during a busy period,
openaire +2 more sources
SIAM Journal on Algebraic Discrete Methods, 1982
The interval count of an interval graph G is the minimum number of different interval sizes needed to represent the vertices of G, where two vertices are adjacent if and only if their intervals intersect.We show that if G is an interval graph and for some vertex x, $G - \{ x \}$ has interval count one, then G has interval count two or less.We also show
Leibowitz, R. +2 more
openaire +2 more sources
The interval count of an interval graph G is the minimum number of different interval sizes needed to represent the vertices of G, where two vertices are adjacent if and only if their intervals intersect.We show that if G is an interval graph and for some vertex x, $G - \{ x \}$ has interval count one, then G has interval count two or less.We also show
Leibowitz, R. +2 more
openaire +2 more sources
Journal of Graph Theory, 1993
AbstractAn interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs.
openaire +1 more source
AbstractAn interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs.
openaire +1 more source
Interval digraphs: An analogue of interval graphs
Journal of Graph Theory, 1989AbstractIntersection digraphs analogous to undirected intersection graphs are introduced. Each vertex is assigned an ordered pair of sets, with a directed edge uv in the intersection digraph when the “source set” of u intersects the “terminal set” of v.
Sandip Das 0001 +3 more
openaire +2 more sources
Combinatorica, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Separator Theorems for Interval Graphs and Proper Interval Graphs
2015C.L.Monma and V.K.Wei [1986, J. Comb. Theory, Ser-B, 41, 141-181] proposed a unified approach to characterize several subclasses of chordal graphs using clique separator. The characterizations so obtained are called separator theorems. Separator theorems play an important role in designing algorithms in subclasses of chordal graphs.
openaire +1 more source
Unit Interval Graphs of Open and Closed Intervals
Journal of Graph Theory, 2012AbstractWe give two structural characterizations of the class of finite intersection graphs of the open and closed real intervals of unit length. This class is a proper superclass of the well‐known unit interval graphs.
Dieter Rautenbach +1 more
openaire +1 more source
2002
Summary: We introduce interval \(k\)-graphs, a family of restricted intersection graphs. The intersection model for interval \(k\)-graphs assigns each vertex to a unique interval in some copy of the real line, with two vertices adjacent whenever their corresponding intervals overlap and belong to distinct copies of \(\mathbb{R}\). Our work is motivated
Brown, David E. +2 more
openaire +1 more source
Summary: We introduce interval \(k\)-graphs, a family of restricted intersection graphs. The intersection model for interval \(k\)-graphs assigns each vertex to a unique interval in some copy of the real line, with two vertices adjacent whenever their corresponding intervals overlap and belong to distinct copies of \(\mathbb{R}\). Our work is motivated
Brown, David E. +2 more
openaire +1 more source
Weighted irredundance of interval graphs
Information Processing Letters, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maw-Shang Chang +2 more
openaire +2 more sources