𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On qualitatively independent partitions and related problems

✍ Scribed by Svatopluk Poljak; Aleš Pultr; Voljtěch Rödl


Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
660 KB
Volume
6
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On partitioning interval graphs into pro
✍ Frédéric Gardi 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 164 KB

In this paper, we establish that any interval graph (resp. circulararc graph) with n vertices admits a partition into at most log 3 n (resp. log 3 n +1) proper interval subgraphs, for n>1. The proof is constructive and provides an efficient algorithm to compute such a partition. On the other hand, t