scientific article
From MaRDI portal
zbMath0988.05087MaRDI QIDQ2768337
Publication date: 30 June 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The parametrized complexity of knot polynomials, Algorithmic uses of the Feferman-Vaught theorem, Farrell polynomials on graphs of bounded tree width, On the algebraic complexity of some families of coloured Tutte polynomials, Counting truth assignments of formulas of bounded tree-width or clique-width, Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width, On the colored Tutte polynomial of a graph of bounded treewidth, Recurrence relations for graph polynomials on bi-iterative families of graphs, Computing HOMFLY polynomials of 2-bridge links from 4-plat representation, From a zoo to a zoology: Towards a general theory of graph polynomials, Fast algorithms for computing Jones polynomials of certain links, Parameterized counting problems
