Semantic Equivalence of Graph Polynomials Definable in Second Order Logic
From MaRDI portal
Publication:2820700
DOI10.1007/978-3-662-52921-8_18zbMath1478.05078OpenAlexW2489714864MaRDI QIDQ2820700
Johann A. Makowsky, Elena V. Ravve
Publication date: 9 September 2016
Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-52921-8_18
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique polynomials have a unique root of smallest modulus
- 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 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
- 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
- On sequences of polynomials arising from graph invariants
- Polynomials with the half-plane property and matroid theory
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas
- 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
- 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
- On stability of Alexander polynomials of knots and links (survey)
- 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
