Deniz, ZakirNivelle, SimonRies, BernardSchindl, David2020-04-302020-04-302018978-3-319-77404-6; 978-3-319-77403-90302-97431611-3349https://doi.org/10.1007/978-3-319-77404-6_27https://hdl.handle.net/20.500.12684/392213th Latin American Theoretical Informatics Symposium (LATIN) -- APR 16-19, 2018 -- Buenos Aires, ARGENTINASchindl, David/0000-0002-7009-5530; Ries, Bernard/0000-0003-4395-5547WOS: 000444835200027In this paper, we are interested in edge intersection graphs of paths in a grid, such that each such path has at most one bend. These graphs were introduced in [12] and they are called B-1-EPG graphs. In particular, we focus on split graphs and characterise those that are B-1-EPG. This characterisation allows us to disprove a conjecture of Cameron et al. [7]. The existence of polynomial-time recognition algorithm for this graph class is still unknown. We furthermore investigate inclusion relationships among subclasses of split graphs that are B-1-EPG.en10.1007/978-3-319-77404-6_27info:eu-repo/semantics/closedAccessConference Object10807361375Q3N/A