✦ LIBER ✦

Cover-Incomparability Graphs of Posets

✍ Scribed by Boštjan Brešar; Manoj Changat; Sandi Klavžar; Matjaž Kovše; Joseph Mathews; Antony Mathews

Publisher: Springer Netherlands
Year: 2008
Tongue: English
Weight: 338 KB
Volume: 25
Category: Article
ISSN: 0167-8094
DOI: 10.1007/s11083-008-9097-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Complexity of Cover-Incomparabili

On the Complexity of Cover-Incomparability Graphs of Posets

✍ Jana Maxová; Pavla Pavlíková; Daniel Turzík 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 330 KB

Covering posets

✍ Gerhard Behrendt 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 811 KB

A pair (a, b) of elements of a partially ordered set (X, G) is called a covering pair if a C b and whenever x E X is such that n sx s b then x E {a, b}. The set C(X) of covering pairs can be partially ordered by (ea, b) S (a', b') if and only if (a, b) = (a', b') or b Sa'. The pose! ) is called the

Incomparability and Intersection Propert

Incomparability and Intersection Properties of Boolean Interval Lattices and Chain Posets

✍ Rudolf Ahlswede; Ning Cai 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 302 KB

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

M-chain graphs of posets

✍ Jenö Lehel; F.R. McMorris; Debra D. Scott 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 531 KB

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.