Diner, Oznur YasarDyer, DannyYang, Boting2023-10-192023-10-19202200166-218X1872-6771https://doi.org/10.1016/j.dam.2021.09.011https://hdl.handle.net/20.500.12469/5130This paper deals with constructing obstruction sets for two subclasses of 4-searchable graphs. We first characterize the 4-searchable biconnected outerplanar graphs by listing all graphs that cannot be their minors; we then give a constructive characterization of such graphs. We also characterize the 4-searchable biconnected generalized wheel graphs by listing all graphs that cannot be their minors. Crown Copyright (C) 2021 Published by Elsevier B.V. All rights reserved.eninfo:eu-repo/semantics/closedAccessSearchMinorsWidthGraph minorsSearchEdge searchingMinorsOuterplanar graphsWidthForbidden minorsArticle7082306WOS:00070930770000610.1016/j.dam.2021.09.0112-s2.0-85116863088Q3Q2