A Logic for Minor-Free Graph Classes: Model Checking, Dependence, and Combinatorial Reconfiguration
It is shown that for every weakly sparse graph class $\mathscr C$, the class $\mathscr C_Z$ is monadically dependent for $\textsf{FOscon}$ if and only if $\mathscr C$ excludes a fixed minor.
Nikolas Mählmann, Patrice Ossona de Mendez, Nicole Schirrmacher et al.
· 0 citations