✦ LIBER ✦

The Computational Complexity of Tutte Invariants for Planar Graphs

✍ Scribed by Vertigan, Dirk

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Inapproximability of the Tutte polynomia

✍ Goldberg, Leslie Ann; Jerrum, Mark 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 515 KB

On the complexity of -colouring planar g

✍ G. MacGillivray; M. Siggers 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 924 KB

The complexity of planar graph choosabil

✍ Shai Gutner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 553 KB

The Complexity of Counting in Sparse, Re

✍ Vadhan, Salil P. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 326 KB

Computing the Tutte Polynomial on Graphs

✍ Giménez, Omer; Hliněný, Petr; Noy, Marc 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 230 KB

The complexity of the chromatic sum prob

✍ Michal Malafiejski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 12 KB