End vertices in interval graphs (Q1119662)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | End vertices in interval graphs |
scientific article |
Statements
End vertices in interval graphs (English)
0 references
1988
0 references
An interval graph is a graph in which there is a one-to-one correspondence between vertices and a family of intervals on the line such that two vertices are adjacent if and only if the corresponding intervals overlap. An end vertex in an interval graph corresponds to the leftmost or rightmost interval in some modeling family of intervals. This note presents a simple forbidden-subgraph characterization of end vertices in an interval graph.
0 references
interval graph
0 references
end vertices
0 references
