𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of H-colouring of bounded degree graphs

✍ Scribed by Anna Galluccio; Pavol Hell; Jaroslav Nešetřil


Book ID
108315482
Publisher
Elsevier Science
Year
2000
Tongue
English
Weight
104 KB
Volume
222
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Topology of bounded-degree graph complex
✍ Xun Dong 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 254 KB

The bounded-degree graph complexes were first introduced by Reiner and Roberts [J. Algebraic Combin. 11 (2000) 135-154]. They arise from the finite free resolution of quadratic Veronese rings and modules. We prove various results about the homotopy types of these complexes, and deduce corresponding