An evolution of interval graphs
From MaRDI portal
Publication:912869
DOI10.1016/0012-365X(90)90206-WzbMath0699.05051OpenAlexW2068291241MaRDI QIDQ912869
Publication date: 1990
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(90)90206-w
Related Items (7)
Random subcube intersection graphs. I: Cliques and covering ⋮ Stochastic service systems, random interval graphs and search algorithms ⋮ A Model for Birdwatching and other Chronological Sampling Activities ⋮ Interval graph limits ⋮ Connectivity threshold for random chordal graphs ⋮ Super-Exponential Extinction Time of the Contact Process on Random Geometric Graphs ⋮ Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem
Cites Work
- Random interval graphs
- The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
- Representation of a finite graph by a set of intervals on the real line
- A Characterization of Comparability Graphs and of Interval Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: An evolution of interval graphs