๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Interval Representations of Cliques and of Subset Intersection Graphs

โœ Scribed by EDWARD R. SCHEINERMAN; DOUGLAS B. WEST

Book ID
119863032
Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
249 KB
Volume
555
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On set intersection representations of g
On set intersection representations of graphs
โœ Stasys Jukna ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 193 KB ๐Ÿ‘ 1 views

## Abstract The intersection dimension of a bipartite graph with respect to a type __L__ is the smallest number __t__ for which it is possible to assign sets __A__~__x__~โŠ†{1, โ€ฆ, __t__} of labels to vertices __x__ so that any two vertices __x__ and __y__ from different parts are adjacent if and only

On intersections of interval graphs
On intersections of interval graphs
โœ H.S. Witsenhausen ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 687 KB
Metric characterizations of proper inter
Metric characterizations of proper interval graphs and tree-clique graphs
โœ Gutierrez, M.; Oubi๏ฟฝa, L. ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 393 KB ๐Ÿ‘ 2 views

A connected graph G is a tree-clique graph if there exists a spanning tree T (a compatible tree) such that every clique of G is a subtree of T. When Tis a path the connected graph G is a proper interval graph which is usually defined as intersection graph of a family of closed intervals of the real