Graph polynomials and local graph operations

DOI10.1007/978-3-031-86319-6_30MaRDI QIDQ7236657zbMATH OpenFDO

Authors Peter Tittmann

Publication date 29 April 2026

Full work available at URL https://doi.org/10.1007/978-3-031-86319-6_30

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Combinatorics (05-XX) Computer science (68-XX)

Cites work

• A Combinatorial Model for Series-Parallel Networks
• A Contribution to the Theory of Chromatic Polynomials
• A Course in Enumeration
• A determinant formula for the number of ways of coloring a map.
• A linear algorithm for the domination number of a series-parallel graph
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• A logical expansion in mathematics
• A logician's view of graph polynomials
• A Most General Edge Elimination Polynomial
• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• A new method for proving chromatic uniqueness of graphs
• A polynomial invariant of graphs on orientable surfaces
• A two-variable interlace polynomial
• Acyclic polynomials of graphs
• An extension of the bivariate chromatic polynomial
• An introduction to chromatic polynomials
• An introduction to matching polynomials
• Clique polynomials and independent set polynomials of graphs
• Finding a Maximum Independent Set
• From a zoo to a zoology: Towards a general theory of graph polynomials
• Graph polynomials and their applications. I: The Tutte polynomial
• Graph polynomials derived from Tutte-Martin polynomials
• Graph polynomials: from recursive definitions to subset expansion formulas
• Graph theory
• Graphs on surfaces. Dualities, polynomials, and knots
• scientific article; zbMATH DE number 3836093 (Why is no real title available?)
• scientific article; zbMATH DE number 3934150 (Why is no real title available?)
• scientific article; zbMATH DE number 1151365 (Why is no real title available?)
• scientific article; zbMATH DE number 1445310 (Why is no real title available?)
• Interlace polynomials
• Linear Recurrence Relations for Graph Polynomials
• Linear-time computability of combinatorial problems on series-parallel graphs
• Matroids, delta-matroids and embedded graphs
• Mean value for the matching and dominating polynomial
• Neighborhood and domination polynomials of graphs
• On sequences of polynomials arising from graph invariants
• On the complexity of generalized chromatic polynomials
• On the edge cover polynomial of a graph
• On the zeros of domination polynomial of a graph
• Polychromatic polynomials
• Polynomial Invariants of Graphs
• Recurrence relations and splitting formulas for the domination polynomial
• Skein polynomials and the Tutte polynomial when x = y
• Subset-sum representations of domination polynomials
• The covered components polynomial: a new representation of the edge elimination polynomial
• The enumeration of vertex induced subgraphs with respect to the number of components
• The Random-Cluster Model
• The universal edge elimination polynomial and the dichromatic polynomial
• Topology of series-parallel networks

This page was built for publication: Graph polynomials and local graph operations

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