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

A characterization of horizontal visibility graphs and combinatorics on words

โœ Scribed by Gregory Gutin; Toufik Mansour; Simone Severini

Publisher
Elsevier Science
Year
2011
Tongue
English
Weight
221 KB
Volume
390
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A note on the characterization of domina
A note on the characterization of domination perfect graphs
โœ Jason Fulman ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 191 KB

## Abstract A graph __G__ is domination perfect if for each induced subgraph __H__ of __G__, ฮณ(__H__) = __i__(__H__), where ฮณ and __i__ are a graph's domination number and independent domination number, respectively. Zverovich and Zverovich [3] offered a finite forbidden induced characterization of

A new characterization of graphs based o
A new characterization of graphs based on interception relations
โœ Paz, Azaria; Pearl, Judea; Ur, Shmuel ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 713 KB

While graphs are normally defined in terms of the 2-place relation of adjacency, we take the 3-place relation of interception as the basic primitive of their definition. The paper views graphs as an economical scheme for encoding interception relations, and establishes an axiomatic characterization