𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Torus graphs and simplicial posets

✍ Scribed by Hiroshi Maeda; Mikiya Masuda; Taras Panov

Book ID
108051531
Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
278 KB
Volume
212
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Posets and planar graphs
Posets and planar graphs
✍ Stefan Felsner; William T. Trotter πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 112 KB

## Abstract Usually __dimension__ should be an integer valued parameter. We introduce a refined version of dimension for graphs, which can assume a value [__t__β€‰βˆ’β€‰1 ↕ __t__], thought to be between __t__β€‰βˆ’β€‰1 and __t__. We have the following two results: (a) a graph is outerplanar if and only if its

On simplicial and co-simplicial vertices
On simplicial and co-simplicial vertices in graphs
✍ Chı́nh T HoΓ ng; Stefan Hougardy; FrΓ©dΓ©ric Maffray; N.V.R Mahadev πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 286 KB

We investigate the class of graphs deΓΏned by the property that every induced subgraph has a vertex which is either simplicial (its neighbours form a clique) or co-simplicial (its non-neighbours form an independent set). In particular we give the list of minimal forbidden subgraphs for the subclass o

Median graphs, parallelism and posets
Median graphs, parallelism and posets
✍ Jean-Pierre BarthΓ©lemy; Julien Constantin πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 989 KB

A notion of parallelism is defined in finite median graphs and a number of properties about geodesics and the existence of cubes are obtained. Introducing sites as a double structure of partial order and graph on a set, it is shown that all median graphs can be constructed from sites and, in fact, t