Chronological orderings of interval graphs (Q795848): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q224654 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Mario Gionfriddo / rank | |||
Normal rank |
Revision as of 19:47, 11 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Chronological orderings of interval graphs |
scientific article |
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