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