A short proof of the degree bound for interval number (Q1114708)
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: A short proof of the degree bound for interval number |
scientific article; zbMATH DE number 4083665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A short proof of the degree bound for interval number |
scientific article; zbMATH DE number 4083665 |
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
0 references
0.8586538
0 references
0.85512805
0 references
0.85489464
0 references
0.85400105
0 references
0 references
0.8493021
0 references
0.84883726
0 references
0.84791124
0 references
