Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes

DOI10.1137/1.9781611977554.CH141MaRDI QIDQ6538674

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

Publication date: 14 May 2024

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Faster parameterized algorithms for modification problems to minor-closed classes ⋮ Computing paths of large rank in planar frameworks deterministically

This page was built for publication: Model-checking for first-order logic with disjoint paths predicates in proper minor-closed graph classes

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