Chronological orderings of interval graphs (Q795848)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Chronological orderings of interval graphs |
scientific article; zbMATH DE number 3863256
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Chronological orderings of interval graphs |
scientific article; zbMATH DE number 3863256 |
Statements
Chronological orderings of interval graphs (English)
0 references
1984
0 references
An interval graph is a graph, which is the intersection graph of a set of intervals of the real line. The set of intervals is called an interval representation of the graph. This paper gives three methods for describing the differences of the order of the endpoints of the intervals along the line.
0 references
interval graph
0 references
interval representation
0 references
intersection graph
0 references
0.878345251083374
0 references
0.8152309656143188
0 references
0.794245719909668
0 references
0.7864720821380615
0 references
