[1]}
Let b̏e a class of graphs with bounded expansion and let \(\psi \)  be a
sentence of FO. Then, for all \(\textsc {f}\vec{\textbf {G}} \in , testing whether\)\(\textsc {f}\vec{\textbf {G}}\)  \( can be done in time \) O(||\(\textsc {f}\vec{\textbf {G}}\)  ||)\(.\)
