The Specker-Blatter Theorem Revisited
From MaRDI portal
Publication:3082916
DOI10.1007/3-540-45071-8_11zbMath1276.03034OpenAlexW1576906924MaRDI QIDQ3082916
Eldar Fischer, Johann A. Makowsky
Publication date: 18 March 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45071-8_11
Exact enumeration problems, generating functions (05A15) Recurrences (11B37) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Model theory of finite structures (03C13)
Related Items (7)
On the Tutte and Matching Polynomials for Complete Graphs ⋮ Parameterized model checking of rendezvous systems ⋮ Algorithmic uses of the Feferman-Vaught theorem ⋮ The Specker-Blatter theorem does not hold for quaternary relations ⋮ Remembering Ernst Specker (1920--2011) ⋮ Unnamed Item ⋮ Definability of Combinatorial Functions and Their Linear Recurrence Relations
This page was built for publication: The Specker-Blatter Theorem Revisited
