✦ LIBER ✦

M-chain graphs of posets

✍ Scribed by Jenö Lehel; F.R. McMorris; Debra D. Scott

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 531 KB
Volume: 74
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(89)90149-0

No coin nor oath required. For personal study only.

✦ Synopsis

The m-chain graph of a finite poset is defined as a generalization of the covering graph. 2-chain graphs of posets whose covering graphs are trees are characterized.

📜 SIMILAR VOLUMES

Poset boxicity of graphs

✍ W.T Trotter Jr.; Douglas B West 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 197 KB

A t-box representation of a graph encodes each vertex as a box in t-space determined by the (integer) coordinates of its lower and upper corner, such that vertices are adjacent if and only if the corresponding boxes intersect. The boxicity of a graph G is the minirmlm t for which this can be done; e

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

Cover-Incomparability Graphs of Posets

✍ Boštjan Brešar; Manoj Changat; Sandi Klavžar; Matjaž Kovše; Joseph Mathews; Anto 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 338 KB

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

Planar graphs and poset dimension

✍ Walter Schnyder 📂 Article 📅 1989 🏛 Springer Netherlands 🌐 English ⚖ 946 KB

Perfect sequences of chain-complete pose

Perfect sequences of chain-complete posets

✍ Jonathan David Farley 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 977 KB

The formation of a perfect sequence for a chain-complete poset generalizes the process of dismantling a finite poset by irreducibles. In the finite case, according to a theorem of Duffus and Rival, the end result, or 'core,' is unique up to isomorphism, no matter how the poset is dismantled. For cha