A Logic for Minor-Free Graph Classes: Model Checking, Dependence, and Combinatorial Reconfiguration

Nikolas Mählmann, Patrice {Ossona de Mendez}, Nicole Schirrmacher +4

We introduce \emph{sub-connectivity logic}, denoted by $\text{FOscon}$, an extension of first-order logic for graphs with a specified set $Z$ of admissible edges. Its additional…