Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes

zbMatharXiv:2211.01723MaRDI QIDQ6508134

Petr A. Golovach, Giannos Stamoulis, Dimitrios M. Thilikos

Publication date: 1 January 1

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85) Model theory of finite structures (03C13) General topics in the theory of algorithms (68W01) Descriptive complexity and finite models (68Q19) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes