Abstract
In 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.
Cite
CITATION STYLE
Deniz, Z., Nivelle, S., Ries, B., & Schindl, D. (2020). On Some Subclasses of Split B1 -EPG Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12118 LNCS, pp. 625–636). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-61792-9_49
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
