Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas

From MaRDI portal
Publication:2882559
Jump to:navigation, search

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


zbMATH Keywords

graph theoryfinite model theorygraph polynomialssecond order logic


Mathematics Subject Classification ID

Graph polynomials (05C31) Model theory of finite structures (03C13)


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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2882559&oldid=15831470"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 20:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki