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

On metric properties of certain clique graphs

โœ Scribed by Edward Howorka

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
353 KB
Volume
27
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

On clique partitions of split graphs
On clique partitions of split graphs
โœ W.D. Wallis; J. Wu ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 204 KB

Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique