✦ LIBER ✦

On the colored Tutte polynomial of a graph of bounded treewidth

✍ Scribed by Lorenzo Traldi

Book ID: 108112558
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 162 KB
Volume: 154
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.09.013

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for the Tutte polynomials o

An algorithm for the Tutte polynomials of graphs of bounded treewidth

✍ Artur Andrzejak 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 744 KB

Computing the Tutte Polynomial on Graphs

Computing the Tutte Polynomial on Graphs of Bounded Clique‐Width

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

On bounded treewidth duality of graphs

✍ Ne?et?il, Jaroslav; Zhu, Xuding 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 734 KB

For a graph H , the H-coloring problem is to decide whether or not an instance graph G is homomorphic to H . The H-coloring problem is said to have bounded treewidth duality if there is an integer k such that for any graph G which is not homomorphic to H , there is a graph F of treewidth k which is

Channel assignment on graphs of bounded

Channel assignment on graphs of bounded treewidth

✍ Colin McDiarmid; Bruce Reed 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 211 KB

Inapproximability of the Tutte polynomia

Inapproximability of the Tutte polynomial of a planar graph

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

On Tutte polynomials and cycles of plane

On Tutte polynomials and cycles of plane graphs

✍ François Jaeger 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 901 KB