✦ LIBER ✦

On the parameterized complexity of coloring graphs in the absence of a linear forest

✍ Scribed by Couturier, Jean-François; Golovach, Petr A.; Kratsch, Dieter; Paulusma, Daniël

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Updating the complexity status of colori

✍ Hajo Broersma; Petr A. Golovach; Daniël Paulusma; Jian Song 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 330 KB

A Complexity Dichotomy for the Coloring

✍ Louis Esperet; Mickaël Montassier; Pascal Ochem; Alexandre Pinlou 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 701 KB

Parameterized complexity of the induced

✍ Venkatesh Raman; Somnath Sikdar 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 139 KB

The coloring of graphs in a linear numbe

✍ A. A. Kalnin'sh 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 830 KB

On the Parameterized Complexity of Layer

✍ Vida Dujmović; Michael R. Fellows; Matthew Kitching; Giuseppe Liotta; Catherine 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 537 KB

The Coloring Ideal and Coloring Complex

✍ Einar Steingrímsson 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 103 KB