𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the algorithmic complexity of coloring simple hypergraphs and steiner triple systems

✍ Scribed by Kevin T. Phelps; Vojtěch Rödl

Book ID
110564214
Publisher
Springer-Verlag
Year
1984
Tongue
English
Weight
474 KB
Volume
4
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic numbers of Steiner trip
On the chromatic numbers of Steiner triple systems
✍ Lucien Haddad 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

Geometric properties are used to determine the chromatic number of AG(4, 3) and to derive some important facts on the chromatic number of PG(n, 2). It is also shown that a 4-chromatic STS(v) exists for every admissible order v ≥ 21.

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithms and Computation Volume 3827 || On the Computation of Colored Domino Tilings of Simple and Non-simple Orthogonal Polygons
✍ Deng, Xiaotie; Du, Ding-Zhu 📂 Article 📅 2005 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 359 KB

This Book Constitutes The Refereed Proceedings Of The 16th International Symposium On Algorithms And Computation, Isaac 2005, Held In Sanya, Hainan, China In December 2005. The 112 Revised Full Papers Presented Were Carefully Reviewed And Selected From 549 Submissions. The Papers Are Organized In To