On the Interval Number of a Triangulated
โ
Thomas Andreae
๐
Article
๐
1987
๐
John Wiley and Sons
๐
English
โ 414 KB
๐ 2 views
The interval number of a simple undirected graph G, denoted i(G), is the least nonnegative integer r for which we can assign to each vertex in G a collection of at most r intervals on the real line such that two distinct vertices u and w of G are adjacent if and only if some interval for u intersect