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

Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs

โœ Scribed by Kratsch, Dieter; McConnell, Ross M.; Mehlhorn, Kurt; Spinrad, Jeremy P.

Book ID
118181281
Publisher
Society for Industrial and Applied Mathematics
Year
2006
Tongue
English
Weight
275 KB
Volume
36
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Recognizing edge clique graphs among int
Recognizing edge clique graphs among interval graphs and probe interval graphs
โœ Jing Kong; Yaokun Wu ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB

The edge clique graph of a graph H is the one having the edge set of H as vertex set, two vertices being adjacent if and only if the corresponding edges belong to a common complete subgraph of H . We characterize the graph classes {edge clique graphs} โˆฉ {interval graphs} as well as {edge clique grap