On grounded L-graphs and their relatives

article On grounded L-graphs and their relatives published yes Vít Jelínek author Martin Töpfer author 4B865388-F248-11E8-B48F-1D18A9856A87 DaAl department International IST Doctoral Program project We consider the graph class Grounded-L corresponding to graphs that admit an intersection representation by L-shaped curves, where additionally the topmost points of each curve are assumed to belong to a common horizontal line. We prove that Grounded-L graphs admit an equivalent characterisation in terms of vertex ordering with forbidden patterns. We also compare this class to related intersection classes, such as the grounded segment graphs, the monotone L-graphs (a.k.a. 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. https://research-explorer.ista.ac.at/download/6759/6764/2019_eJourCombinatorics_Jelinek.pdf application/pdfno Electronic Journal of Combinatorics2019 eng Electronic Journal of Combinatorics 1077-8926 1808.0414810.37236/8096 263 Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:<a href="https://doi.org/10.37236/8096">10.37236/8096</a> Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17. Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. <a href="https://doi.org/10.37236/8096">https://doi.org/10.37236/8096</a>. V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019). V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019. Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. <a href="https://doi.org/10.37236/8096">https://doi.org/10.37236/8096</a> Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:<a href="https://doi.org/10.37236/8096">10.37236/8096</a>. 67592019-08-04T21:59:20Z2025-06-26T12:25:39Z