.
that contains
G
as a subgraph, i.e.,
.
An interval graph is a graph whose vertices can be mapped to distinct intervals
in the real line such that two vertices in the graph have an edge between
them if and only if their corresponding intervals overlap.
[
308
].
Viggo Kann