𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Median graphs, parallelism and posets

✍ Scribed by Jean-Pierre Barthélemy; Julien Constantin

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
989 KB
Volume
111
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

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, that the categories of sites and pointed median graphs are equivalent, generalizing Birkhoff's duality.

📜 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

Some theorems on graphs and posets
Some theorems on graphs and posets
✍ William T. Trotter Jr.; John I. Moore Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 800 KB

In this journal, Lcclerc proved that the dimension of the partiailly ordered slet consisting of all subf~ce'~ of a tree T, m&red by inclusion, is the number of end yuints of 'I'. Leclerc posed the probkrn of determitAng the dimension the partially ed set P consisting of all inducxxI connected subgra

n-cubes and median graphs
n-cubes and median graphs
✍ Martyn Mulder 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB

## Abstract The n‐cube is characterized as a connected regular graph in which for any three vertices __u, v__, and __w__ there is a unique vertex that lies simultaneously on a shortest (__u, v__)‐path, a shortest (__v, w__)‐path, and a shortest (__w, u__)‐path.

Infinite median graphs, (0, 2)-graphs, a
Infinite median graphs, (0, 2)-graphs, and hypercubes
✍ Hans-J. Bandelt; Henry Martyn Mulder 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 450 KB

Hypercubes are characterized among connected bipartite graphs by interval conditions in several ways. These results are based on the following two facts: (i) connected bipartite graphs are median provided that all their intervals induce median graphs, and (ii) median (0, 2)graphs are hypercubes. No