A logician's view of graph polynomials
From MaRDI portal
Publication:2273013
DOI10.1016/j.apal.2019.04.007zbMath1477.03122arXiv1703.02297OpenAlexW2963691321WikidataQ128116912 ScholiaQ128116912MaRDI QIDQ2273013
Tomer Kotek, Elena V. Ravve, Johann A. Makowsky
Publication date: 18 September 2019
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.02297
generating functionsgraph invariantschromatic polynomialsgraph polynomialsdistinguishing powerzeros of graph polynomials
Related Items
Harary polynomials, Weakly distinguishing graph polynomials on addable properties, Almost unimodal and real-rooted graph polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique polynomials have a unique root of smallest modulus
- Strongly polynomial sequences as interpretations
- On the location of roots of independence polynomials
- Algorithmic uses of the Feferman-Vaught theorem
- On the roots of edge cover polynomials of graphs
- Spectra of graphs
- On the complexity of generalized chromatic polynomials
- Elements of finite model theory.
- On the location of roots of graph polynomials
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- The roots of the independence polynomial of a clawfree graph
- Applications of stable polynomials to mixed determinants: Johnson's conjectures, unimodality, and symmetrized Fischer products
- From a zoo to a zoology: Towards a general theory of graph polynomials
- A criterion for the half-plane property
- An extension of the bivariate chromatic polynomial
- Matching theory
- Connections between the matching and chromatic polynomials
- A weighted graph polynomial from chromatic invariants of knots
- Clique polynomials and independent set polynomials of graphs
- Homogeneous multivariate polynomials with the half-plane property
- Coloured Tutte polynomials and Kauffman brackets for graphs of bounded tree width
- Chromatic invariants for finite graphs: Theme and polynomial variations
- On sequences of polynomials arising from graph invariants
- Polynomials with the half-plane property and matroid theory
- Theory of monomer-dimer systems
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- Semantic Equivalence of Graph Polynomials Definable in Second Order Logic
- Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas
- Connection Matrices and the Definability of Graph Parameters
- Hyperbolic polynomials approach to Van der Waerden/Schrijver-Valiant like conjectures
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- Multivariate stable polynomials: theory and applications
- Negative dependence and the geometry of polynomials
- Linear matrix inequality representation of sets
- On Counting Generalized Colorings
- The Equivalence of Two Graph Polynomials and a Symmetric Function
- Tutte Polynomials and Link Polynomials
- On the theory of the matching polynomial
- Necessary and sufficient conditions for the Hurwitz and Schur stability of interval matrices
- Chromatic Roots are Dense in the Whole Complex Plane
- Hyperbolicity and stable polynomials in combinatorics and probability
- Evaluations of Graph Polynomials
- Lee-Yang theorems and the complexity of computing averages
- A Computational Framework for the Study of Partition Functions and Graph Polynomials
- A Contribution to the Theory of Chromatic Polynomials
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic
