[{"date_created":"2019-08-04T21:59:20Z","ddc":["510"],"publisher":"Electronic Journal of Combinatorics","status":"public","article_processing_charge":"Yes","oa_version":"Published Version","arxiv":1,"volume":26,"publication_status":"published","ec_funded":1,"OA_type":"gold","scopus_import":"1","date_published":"2019-07-19T00:00:00Z","file":[{"relation":"main_file","date_updated":"2020-07-14T12:47:39Z","content_type":"application/pdf","access_level":"open_access","date_created":"2019-08-05T06:46:55Z","file_name":"2019_eJourCombinatorics_Jelinek.pdf","file_id":"6764","file_size":533697,"creator":"dernst","checksum":"20fc366fc6683ef0b074a019b73a663a"}],"article_number":"P3.17","date_updated":"2025-06-26T12:25:39Z","quality_controlled":"1","has_accepted_license":"1","language":[{"iso":"eng"}],"title":"On grounded L-graphs and their relatives","year":"2019","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"abstract":[{"text":"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. \r\nWe 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.","lang":"eng"}],"DOAJ_listed":"1","citation":{"ama":"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>","short":"V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).","mla":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” <i>Electronic Journal of Combinatorics</i>, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:<a href=\"https://doi.org/10.37236/8096\">10.37236/8096</a>.","ista":"Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.","apa":"Jelínek, V., &#38; Töpfer, M. (2019). On grounded L-graphs and their relatives. <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics. <a href=\"https://doi.org/10.37236/8096\">https://doi.org/10.37236/8096</a>","chicago":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” <i>Electronic Journal of Combinatorics</i>. Electronic Journal of Combinatorics, 2019. <a href=\"https://doi.org/10.37236/8096\">https://doi.org/10.37236/8096</a>.","ieee":"V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” <i>Electronic Journal of Combinatorics</i>, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019."},"author":[{"first_name":"Vít","full_name":"Jelínek, Vít","last_name":"Jelínek"},{"id":"4B865388-F248-11E8-B48F-1D18A9856A87","last_name":"Töpfer","full_name":"Töpfer, Martin","first_name":"Martin"}],"type":"journal_article","oa":1,"project":[{"call_identifier":"H2020","grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"publication":"Electronic Journal of Combinatorics","day":"19","publication_identifier":{"eissn":["1077-8926"]},"doi":"10.37236/8096","article_type":"original","external_id":{"arxiv":["1808.04148"]},"department":[{"_id":"DaAl"}],"corr_author":"1","issue":"3","_id":"6759","file_date_updated":"2020-07-14T12:47:39Z","intvolume":"        26"}]