A short proof of the degree bound for in
โ
Douglas B. West
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 141 KB
A short proof is given of the fact that every graph has an interval representation of depth 2 in which each vertex u is represented by at most &f(u) + 11 intervals, except for an arbitrarily specified vertex w that appears left-most in the representation and is represented by at most [&d(w) + 1)1 in