Random interval graphs
From MaRDI portal
Publication:1112069
DOI10.1007/BF02189092zbMath0659.05078OpenAlexW1992459191MaRDI QIDQ1112069
Publication date: 1988
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02189092
Related Items (18)
Characterizing intersection classes of graphs ⋮ Efficiently covering complex networks with cliques of similar vertices ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ An algorithm for random signed 3-SAT with intervals ⋮ Interval number of special posets and random posets ⋮ A study on properties of random interval graphs and Erdős Rényi graph 𝒢(n, 2/3) ⋮ Stochastic service systems, random interval graphs and search algorithms ⋮ On the unit interval number of a graph ⋮ On intersection representations of co-planar graphs ⋮ A Model for Birdwatching and other Chronological Sampling Activities ⋮ Interval scheduling and colorful independent sets ⋮ Interval graph limits ⋮ An evolution of interval graphs ⋮ The intersection graph of random sets ⋮ On hard instances of non-commutative permanent ⋮ On the typical case complexity of graph optimization ⋮ A note on the interval number of a graph ⋮ Irrepresentability by multiple intersection, or why the interval number is unbounded
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the interval number of a graph
- The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
- On Hamilton's ideals
- Representation of a finite graph by a set of intervals on the real line
- A Characterization of Comparability Graphs and of Interval Graphs
This page was built for publication: Random interval graphs