Evaluating a weighted graph polynomial for graphs of bounded tree-width

zbMATH Open1209.05249MaRDI QIDQ1028845FDOQ1028845

Authors: Steven D. Noble 

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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
• An algorithm for the Tutte polynomials of graphs of bounded treewidth
• Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width
• Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
• Fast evaluation of interlace polynomials on graphs of bounded treewidth

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

Cited In (15)

• Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
• Title not available (Why is that?)
• The Tutte-Potts connection in the presence of an external magnetic field
• Trimming weighted graphs of bounded treewidth
• An extension of the bivariate chromatic polynomial
• Exact counting of Euler tours for generalized series-parallel graphs
• Plethysms of chromatic and Tutte symmetric functions
• Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
• A vertex-weighted Tutte symmetric function, and constructing graphs with equal chromatic symmetric function
• Fast evaluation of interlace polynomials on graphs of bounded treewidth
• Farrell polynomials on graphs 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
• Title not available (Why is that?)
• Almost linear time computation of the chromatic polynomial of a graph of bounded tree-width

This page was built for publication: Evaluating a weighted graph polynomial for graphs of bounded tree-width

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1028845)