Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas
From MaRDI portal
Publication:2882559
DOI10.1093/logcom/exq006zbMath1239.05095arXiv0812.1364OpenAlexW2012840916MaRDI QIDQ2882559
No author found.
Publication date: 7 May 2012
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.1364
Related Items
The enumeration of vertex induced subgraphs with respect to the number of components ⋮ A logician's view of graph polynomials ⋮ On the location of roots of graph polynomials ⋮ Semantic Equivalence of Graph Polynomials Definable in Second Order Logic