𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An upper bound on the “dimension of interval orders”

✍ Scribed by I Rabinovitch

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
196 KB
Volume
25
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An upper bound for orders of certain (k,
An upper bound for orders of certain (k, k))-connected graphs
✍ Kiyoshi Ando 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 275 KB

A fragment of a connected graph G is a subset A of V(C) consisting of components of G-S such that V(G)-S-A #0 where S is a minimum cut of G. A graph G is said to be (k, I;)- We prove the following result. Let k and k be integers with 1 <i < k, and let G be a critically (k, k)-connected graph. If no

The Order Upper Bound on Parity Embeddin
The Order Upper Bound on Parity Embedding of a Graph
✍ Thomas Zaslavsky 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 398 KB

A graph 1 is parity embedded in a surface if a closed path in the graph is orientation preserving or reversing according to whether its length is even or odd. The parity demigenus of 1 is the minimum of 2&/(S) (where / is the Euler characteristic) over all surfaces S in which 1 can be parity embedde

On the complexity of interval orders and
On the complexity of interval orders and semiorders
✍ U. Faigle; Gy. Turán 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 607 KB

The recognition complexity of interval orders is shown to be Q(n log, n), and an optimal algorithm is given for the identification of semiorders. \* Supported by the joint research project "Algorithmic Aspects of Combinatorial Optimization" of the Hungarian Academy of Sciences (Magyar Tudomanyos Aka