✦ LIBER ✦

On Minimal Prime Graphs and Posets

✍ Scribed by Maurice Pouzet; Imed Zaguia

Book ID: 106489686
Publisher: Springer Netherlands
Year: 2009
Tongue: English
Weight: 435 KB
Volume: 26
Category: Article
ISSN: 0167-8094
DOI: 10.1007/s11083-009-9131-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On k-homogeneous posets and graphs

✍ M Droste; H.D Macpherson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 856 KB

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

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

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

Torus graphs and simplicial posets

✍ Hiroshi Maeda; Mikiya Masuda; Taras Panov 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 278 KB

Graph coloring and monotone functions on

Graph coloring and monotone functions on posets

✍ Nathan Linial 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 79 KB

The purpose of this note is to point out a relationship between graph coloring and monotone functions defined on posets. This relationship permits us to deduce certain properties of the chromatic polynomial of a graph.