Meta-theorems for graph polynomials

DOI10.1007/978-3-031-76738-8_21MaRDI QIDQ6860647zbMATH OpenFDO

Authors Johann A. Makowsky

Publication date 10 February 2026

Full work available at URL https://doi.org/10.1007/978-3-031-76738-8_21

Mathematics Subject Classification ID

Partial differential equations (35-XX) Dynamical systems and ergodic theory (37-XX) Ordinary differential equations (34-XX) Global analysis, analysis on manifolds (58-XX)

Cites work

• scientific article; zbMATH DE number 428989 (Why is no real title available?)
• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 3885934 (Why is no real title available?)
• scientific article; zbMATH DE number 5130736 (Why is no real title available?)
• scientific article; zbMATH DE number 5130821 (Why is no real title available?)
• scientific article; zbMATH DE number 4112649 (Why is no real title available?)
• scientific article; zbMATH DE number 67324 (Why is no real title available?)
• scientific article; zbMATH DE number 1324669 (Why is no real title available?)
• scientific article; zbMATH DE number 475615 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 1545676 (Why is no real title available?)
• scientific article; zbMATH DE number 1369835 (Why is no real title available?)
• A Course in Enumeration
• A Decomposition for Combinatorial Geometries
• A Sufficient Condition for All the Roots of a Polynomial To Be Real
• A computational framework for the study of partition functions and graph polynomials
• A counterexample to a conjecture of Scott and Suppes
• A logician's view of graph polynomials
• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• Acyclic polynomials of graphs
• Algorithmic uses of the Feferman-Vaught theorem
• Almost unimodal and real-rooted graph polynomials
• An extension of the bivariate chromatic polynomial
• An introduction to chromatic polynomials
• Application of logic to combinatorial sequences and their recurrence relations
• Christoffel-Darboux type identities for the independence polynomial
• Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reductions
• Computational Complexity
• Contraction-deletion invariants for graphs
• Elements of finite model theory.
• Extensions and limits of the Specker-Blatter theorem
• From a zoo to a zoology: Towards a general theory of graph polynomials
• Graph polynomials: from recursive definitions to subset expansion formulas
• Graph structure and monadic second-order logic. A language-theoretic approach
• Graphs determined by polynomial invariants
• Hard Enumeration Problems in Geometry and Combinatorics
• Logical Approaches to Computational Barriers
• Maximal-clique partitions and the roller coaster conjecture
• Milnor numbers of projective hypersurfaces and the chromatic polynomial of graphs
• Monadic second-order evaluations on tree-decomposable graphs
• On Counting Generalized Colorings
• On P-unique hypergraphs
• On a general class of graph polynomials
• On counting generalized colorings
• On sequences of polynomials arising from graph invariants
• On the complexity of generalized chromatic polynomials
• On the computational complexity of the Jones and Tutte polynomials
• On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
• On the location of roots of graph polynomials
• On the theory of the matching polynomial
• On the unimodality of domination polynomials
• On the unimodality of independence polynomials of very well-covered graphs
• On unimodal sequences of graphical invariants
• On weakly distinguishing graph polynomials
• Parametrized complexity theory.
• Preservation theorems in finite model theory
• Proper minor-closed families are small
• Random planar graphs
• Strong Tutte Functions of Matroids and Graphs
• The complexity of partition functions
• The complexity of satisfiability problems
• The enumeration of vertex induced subgraphs with respect to the number of components
• The interlace polynomial of a graph
• The roots of the independence polynomial of a clawfree graph
• Unimodality of independence polynomials of rooted products of graphs
• Unimodality, log-concavity, real-rootedness and beyond

This page was built for publication: Meta-theorems for graph polynomials

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