On the Tutte and Matching Polynomials for Complete Graphs

DOI10.3233/FI-222124MaRDI QIDQ5038571

Johann A. Makowsky, Tomer Kotek

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the roots of domination polynomial of graphs
• Elements of finite model theory.
• The interlace polynomial of a graph
• Depth-first search as a combinatorial correspondence
• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• An extension of the bivariate chromatic polynomial
• Hermite polynomials and a duality relation for matchings polynomials
• On the size of hereditary classes of graphs
• The Specker-Blatter theorem does not hold for quaternary relations
• The speed of hereditary properties of graphs
• Enumerative applications of a decomposition for graphs and digraphs
• Recursive families of graphs
• Theory of monomer-dimer systems
• Congruence properties of the polynomials of Hermite, Laguerre and Legendre
• The Number of Labeled Connected Graphs Modulo Prime Powers
• Proving properties of the edge elimination polynomial using equivalent graph polynomials
• The Specker-Blatter Theorem Revisited
• The Enumeration of Locally Restricted Graphs (I)
• Modular Counting and Substitution of Structures
• A Most General Edge Elimination Polynomial
• Linear Recurrence Relations for Graph Polynomials
• Finite automata and the logic of one-place predicates
• The Enumeration of Locally Restricted Graphs (II)
• A Contribution to the Theory of Chromatic Polynomials
• The penultimate rate of growth for graph properties
• Measures on monotone properties of graphs