On grounded \(\llcorner\)-graphs and their relatives (Q2315438)

Summary: We consider the graph classes \textsc{Grounded}-\(\llcorner\) and \textsc{Grounded}-\(\{\llcorner,\lrcorner\}\) corresponding to graphs that admit an intersection representation by \(\llcorner\)-shaped curves (or \(\llcorner\)-shaped and \(\lrcorner\)-shaped curves, respectively), where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that \textsc{Grounded}-\(\llcorner\) graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. We also compare these classes to related intersection classes, such as the grounded segment graphs, the monotone \(\llcorner\)-graphs (also known as max point-tolerance graphs), or the outer-1-string graphs. We give constructions showing that these classes are all distinct and satisfy only trivial or previously known inclusions.