Posets with interval upper bound graphs (Q1104348): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (5 intermediate revisions by 4 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Mario Gionfriddo / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Mario Gionfriddo / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3773926 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3328583 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Representation of a finite graph by a set of intervals on the real line / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3039403 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Comparability Graph of a Tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Note on "The Comparability Graph of a Tree" / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00400290 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1973175203 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:51, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Posets with interval upper bound graphs |
scientific article |
Statements
Posets with interval upper bound graphs (English)
0 references
1986
0 references
Competition graphs of transitive acyclic digraphs are strict upper bound graphs. In this paper the author characterizes those posets which can be considered transitive acyclic digraphs which have bound graphs that are interval graphs.
0 references
Competition graphs
0 references
transitive acyclic digraphs
0 references
upper bound graphs
0 references
interval graphs
0 references
