✦ LIBER ✦

A note on sphere containment orders

✍ Scribed by D. G. Fon-Der-Flaass

Publisher: Springer Netherlands
Year: 1993
Tongue: English
Weight: 203 KB
Volume: 10
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf01111298

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on graphs and sphere orders

✍ Edward R. Scheinerman 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract A partially ordered set __P__ is called a __k‐sphere order__ if one can assign to each element a ∈ __P__ a ball __B__~__a__~ in __R^k^__ so that __a__ < __b__ iff __B__~__a__~ ⊂ __B__~__b__~. To a graph __G__ = (__V,E__) associate a poset __P__(__G__) whose elements are the vertices and

Note on hypergraphs and sphere orders

✍ Alexander Schrijver 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB

## Abstract We show that each partial order ≤ of height 2 can be represented by spheres in Euclidean space, where inclusion represents ≤. If each element has at most __k__ elements under it, we can do this in 2__k__ − 1‐dimensional space. This extends a result (and a method) of Scheinerman for the

On circle containment orders

✍ Edward R. Scheinerman; John C. Wierman 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 250 KB

A note on perfect orders

✍ C.T. Hoáng; N.V.R. Mahadev 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Perfectly orderable graphs were introduced by Chvfital in 1984. Since then, several classes of perfectly orderable graphs have been identified. In this paper, we establish three new results on perfectly orderable graphs. First, we prove that every graph with Dilworth number at most three has a simpl

A note on Hamming spheres

✍ H.J. Tiersma 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 190 KB

simple proofs of three theorems which were proved in a recent paper by J.

A note on vertex orders for stability nu

A note on vertex orders for stability number

✍ Mahadev, N. V. R.; Reed, B. A. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB 👁 2 views

We investigate vertex orders that can be used to obtain maximum stable sets by a simple greedy algorithm in polynomial time in some classes of graphs. We characterize a class of graphs for which the stability number can be obtained by a simple greedy algorithm. This class properly contains previousl