A short proof of the degree bound for interval number (Q1114708): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extremal Values of the Interval Number of a Graph / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:46, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A short proof of the degree bound for interval number |
scientific article |
Statements
A short proof of the degree bound for interval number (English)
0 references
1989
0 references
A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex v is represented by at most \(\lfloor (d(v)+1\rfloor\) intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most \(\lceil (d(w)+1)\rceil\) intervals.
0 references
interval representation
0 references
