Definability and Complexity of Graph Parameters (Invited Talk).

DOI10.4230/LIPICS.CSL.2012.14zbMATH Open1252.03086OpenAlexW2257300851MaRDI QIDQ4649534

Johann A. Makowsky

Publication date: 22 November 2012

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2012/3661/

zbMATH Keywords

graph invariantsfinite model theory

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05) Model theory of finite structures (03C13)

Related Items (1)

Some Remarks on Definability of Process Graphs

This page was built for publication: Definability and Complexity of Graph Parameters (Invited Talk).

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4649534)