Recognizing geometric intersection graphs stabbed by a line

In this paper, we determine the computational complexity of recognizing two graph classes, grounded L-graphs and stabbable grid intersection graphs. An L-shape is made by joining the bottom end-point of a vertical (vertical bar) segment to the left end-point of a horizontal (-) segment. The top endpoint of the vertical segment is known as the anchor of the L-shape. Grounded L-graphs are the intersection graphs of L-shapes such that all the L-shapes' anchors lie on the same horizontal line. We show that recognizing grounded L-graphs is NP-complete. This answers an open question asked by Jelinek & Topfer (Electron. J. Comb., 2019). Grid intersection graphs are the intersection graphs of axis-parallel line segments in which two vertical (similarly, two horizontal) segments cannot intersect. We say that a (not necessarily axis-parallel) straight line l stabs a segment s, if s, intersects l. A graph G is a stabbable grid intersection graph (STABGIG) if there is a grid intersection representation of G in which the same line stabs all its segments. We show that recognizing STABGIG graphs is. NP-complete, even on a restricted class of graphs. This answers an open question asked by Chaplick et al. (Order, 2018).