On grounded L-graphs and their relatives Jelínek, Vít Töpfer, Martin ddc:510 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. Electronic Journal of Combinatorics 2019 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/6759 https://research-explorer.ista.ac.at/download/6759/6764 Jelínek V, Töpfer M. On grounded L-graphs and their relatives. <i>Electronic Journal of Combinatorics</i>. 2019;26(3). doi:<a href="https://doi.org/10.37236/8096">10.37236/8096</a> eng info:eu-repo/semantics/altIdentifier/doi/10.37236/8096 info:eu-repo/semantics/altIdentifier/e-issn/1077-8926 info:eu-repo/semantics/altIdentifier/arxiv/1808.04148 info:eu-repo/semantics/openAccess