On the Tutte and Matching Polynomials for Complete Graphs

DOI10.3233/FI-222124MaRDI QIDQ5038571zbMATH OpenFDO

Authors Tomer Kotek, Johann A. Makowsky

Publication date 7 October 2022

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2112.06581

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• The number of labeled connected graphs modulo prime powers
• Recursively constructible families of graphs
• Planar polycyclic graphs and their Tutte polynomials
• Evaluations of Tutte polynomials of regular graphs
• Permutation Tutte polynomial

Cites work

• A Contribution to the Theory of Chromatic Polynomials
• A Most General Edge Elimination Polynomial
• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• An extension of the bivariate chromatic polynomial
• Application of logic to combinatorial sequences and their recurrence relations
• Congruence properties of the polynomials of Hermite, Laguerre and Legendre
• Depth-first search as a combinatorial correspondence
• Elements of finite model theory.
• Enumerative applications of a decomposition for graphs and digraphs
• Finite automata and the logic of one-place predicates
• Graph structure and monadic second-order logic. A language-theoretic approach
• Hermite polynomials and a duality relation for matchings polynomials
• scientific article; zbMATH DE number 3914328 (Why is no real title available?)
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• Linear Recurrence Relations for Graph Polynomials
• Measures on monotone properties of graphs
• Modular Counting and Substitution of Structures
• On the roots of domination polynomial of graphs
• On the size of hereditary classes of graphs
• Proving properties of the edge elimination polynomial using equivalent graph polynomials
• Recursive families of graphs
• The Enumeration of Locally Restricted Graphs (I)
• The Enumeration of Locally Restricted Graphs (II)
• The interlace polynomial of a graph
• The number of labeled connected graphs modulo prime powers
• The penultimate rate of growth for graph properties
• The Specker-Blatter theorem does not hold for quaternary relations
• The Specker-Blatter theorem revisited
• The speed of hereditary properties of graphs
• Theory of monomer-dimer systems

Cited in

(7)

• On Tutte polynomials and cycles of plane graphs
• Tutte polynomials and related asymptotic limiting functions for recursive families of graphs
• Parity, Eulerian subgraphs and the Tutte polynomial
• scientific article; zbMATH DE number 26485 (Why is no real title available?)
• On maximum graphs in Tutte polynomial posets
• On the Tutte and matching polynomials for complete graphs
• My writing

This page was built for publication: On the Tutte and Matching Polynomials for Complete Graphs

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