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