𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of Cover-Incomparability Graphs of Posets

✍ Scribed by Jana Maxová; Pavla Pavlíková; Daniel Turzík

Publisher
Springer Netherlands
Year
2009
Tongue
English
Weight
330 KB
Volume
26
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cover-Incomparability Graphs of Posets
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
Sphere coverings of the hypercube with i
Sphere coverings of the hypercube with incomparable centers
✍ Zoltán Füredi; Jeff Kahn; Daniel J. Kleitman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 311 KB

It is shown that the shadow of a Sperner family can cover 10 percent of the Boolean algebra. Whether this can be improved to (100 -o(l))% remains open. 1 a91 < c( J2) -=I C' 5 (l-1) holds for every Sperner family 97 This was disproved by Kospanov [8] who

On the coverings of graphs
On the coverings of graphs
✍ F.R.K. Chung 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 383 KB
On covers of graphs
On covers of graphs
✍ Maxová Jaroslav; Jana Nešetřil 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 171 KB

We concentrate on two problems from the area of coverings of graphs, on an oriented version of Perfect Path Double Cover (PPDC) and on oriented version of Weighted Cycle Cover.