scientific article; zbMATH DE number 1504634

MaRDI QIDQ4502591zbMATH OpenFDO

Authors Klaus Meer, Johann A. Makowsky

Publication date 9 November 2001

zbMATH Keywords

hypergraphsmultivariate polynomialstreewidth

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (05C99) Computational aspects and applications of commutative rings (13P99)

Recommendations

• scientific article; zbMATH DE number 1859215
• scientific article; zbMATH DE number 7310078
• Tree-width in algebraic complexity
• Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
• Evaluating a weighted graph polynomial for graphs of bounded tree-width

Cited in

(6)

• Farrell polynomials on graphs of bounded tree width
• On trees with the same restricted \(U\)-polynomial and the Prouhet-Tarry-Escott problem
• scientific article; zbMATH DE number 1859215 (Why is no real title available?)
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• My writing
• Polynomial threshold functions of bounded tree-width: some explainability and complexity aspects

This page was built for publication:

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