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