Evaluating a weighted graph polynomial for graphs of bounded tree-width
From MaRDI portal
Publication:1028845
zbMath1209.05249MaRDI QIDQ1028845
Publication date: 8 July 2009
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/117522
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
Plethysms of chromatic and Tutte symmetric functions ⋮ A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function ⋮ Exact counting of Euler tours for generalized series-parallel graphs ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ Potts models with magnetic field: arithmetic, geometry, and computation ⋮ Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width ⋮ The Tutte-Potts connection in the presence of an external magnetic field ⋮ An extension of the bivariate chromatic polynomial
This page was built for publication: Evaluating a weighted graph polynomial for graphs of bounded tree-width
