Results 291 to 300 of about 586,356 (320)
Some of the next articles are maybe not open access.
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
2001
A bipartite graph with partitions \(P\) and \(C\) is called an interval bigraph, if there exists a family of intervals which associates each vertex of \(G=(V, E)\) with an interval, and for \(x,y \in V\) the edge between \(x\) and \(y\) is in \(E\) if the corresponding intervals intersect and at least one of \(x\) and \(y\) is in \(P\). After a lengthy
Brown, David E. +2 more
openaire +1 more source
A bipartite graph with partitions \(P\) and \(C\) is called an interval bigraph, if there exists a family of intervals which associates each vertex of \(G=(V, E)\) with an interval, and for \(x,y \in V\) the edge between \(x\) and \(y\) is in \(E\) if the corresponding intervals intersect and at least one of \(x\) and \(y\) is in \(P\). After a lengthy
Brown, David E. +2 more
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
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
Weighted irredundance of interval graphs
Information Processing Letters, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, Maw-Shang +2 more
openaire +2 more sources
Graph Searching and Interval Completion
SIAM Journal on Discrete Mathematics, 2000In the classical node-search version for a finite simple undirected graph, in a sequence of moves, at every move a searcher is placed at a vertex or is removed from a vertex. Initially all edges are contaminated (uncleared). A contaminated edge \(xy\) is cleared if on \(x\) and \(y\) searchers are placed. A cleared edge \(e\) is recontaminated if there
Fomin, Fedor V., Golovach, Petr A.
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
Journal of Graph Theory, 1982
AbstractGiven a set F of digraphs, we say a graph G is a F‐graph (resp., F*‐graph) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in F. It is proved that all the classes of graphs mentioned in the title are F‐graphs or F*‐graphs for subsets F of a set of three digraphs.
openaire +1 more source
AbstractGiven a set F of digraphs, we say a graph G is a F‐graph (resp., F*‐graph) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in F. It is proved that all the classes of graphs mentioned in the title are F‐graphs or F*‐graphs for subsets F of a set of three digraphs.
openaire +1 more source
Social determinants of health and US cancer screening interventions: A systematic review
Ca-A Cancer Journal for Clinicians, 2023Ariella R Korn
exaly