Deniz, Z.Nivelle, S.Ries, B.Schindl, D.2021-12-012021-12-012020978303061791203029743https://doi.org/10.1007/978-3-030-61792-9_49https://hdl.handle.net/20.500.12684/997714th Latin American Symposium on Theoretical Informatics, LATIN 2020 -- 5 January 2021 through 8 January 2021 -- -- 252739In this paper, we are interested in edge intersection graphs of paths in a grid, such that each path has at most one bend. These graphs were introduced in[14] and they are called B1-EPG graphs. We focus on split B1-EPG graphs, and study subclasses defined by restricting the paths to subsets of the four possible shapes (?, ?, ? and ? ). We first state that the set of minimal forbidden induced subgraphs for the class of split ? -path graphs is infinite. Then, we further focus on two subclasses, and provide finite forbidden induced subgraphs characterizations for all possible subclasses defined by restricting to any subset of shapes. © 2020, Springer Nature Switzerland AG.en10.1007/978-3-030-61792-9_49info:eu-repo/semantics/closedAccessConference Object12118 LNCS6256362-s2.0-85097722703Q3