[{"_id":"6759","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","ddc":[],"creator":{"id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","login":"dernst"},"date_updated":"2022-03-18T12:32:02Z","department":[{"_id":"DaAl","tree":[{"_id":"ResearchGroups"},{"_id":"IST"}]}],"file_date_updated":"2020-07-14T12:47:39Z","oa_version":"Published Version","abstract":[{"lang":"eng"}],"intvolume":" 26","month":"07","scopus_import":"1","language":[{}],"file":[{"checksum":"20fc366fc6683ef0b074a019b73a663a","file_id":"6764","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2019_eJourCombinatorics_Jelinek.pdf","date_created":"2019-08-05T06:46:55Z","creator":"dernst","file_size":533697,"date_updated":"2020-07-14T12:47:39Z"}],"publication_status":"published","publication_identifier":{"eissn":[]},"ec_funded":1,"volume":26,"issue":"3","article_number":"P3.17","project":[{"name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics. Electronic Journal of Combinatorics, 2019. https://doi.org/10.37236/8096.","ista":"Jelínek V, Töpfer M. 2019. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 26(3), P3.17.","mla":"Jelínek, Vít, and Martin Töpfer. “On Grounded L-Graphs and Their Relatives.” Electronic Journal of Combinatorics, vol. 26, no. 3, P3.17, Electronic Journal of Combinatorics, 2019, doi:10.37236/8096.","apa":"Jelínek, V., & Töpfer, M. (2019). On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. Electronic Journal of Combinatorics. https://doi.org/10.37236/8096","short":"V. Jelínek, M. Töpfer, Electronic Journal of Combinatorics 26 (2019).","ieee":"V. Jelínek and M. Töpfer, “On grounded L-graphs and their relatives,” Electronic Journal of Combinatorics, vol. 26, no. 3. Electronic Journal of Combinatorics, 2019."},"dini_type":"doc-type:article","article_processing_charge":"No","external_id":{"arxiv":[]},"author":[{"last_name":"Jelínek","first_name":"Vít"},{"last_name":"Töpfer","id":"4B865388-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"}],"oa":1,"quality_controlled":"1","dc":{"title":["On grounded L-graphs and their relatives"],"creator":["Jelínek, Vít","Töpfer, Martin"],"language":["eng"],"rights":["info:eu-repo/semantics/openAccess"],"subject":["ddc:510"],"date":["2019"],"publisher":["Electronic Journal of Combinatorics"],"type":["info:eu-repo/semantics/article","doc-type:article","text","http://purl.org/coar/resource_type/c_6501"],"source":["Jelínek V, Töpfer M. On grounded L-graphs and their relatives. Electronic Journal of Combinatorics. 2019;26(3). doi:10.37236/8096"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.37236/8096","info:eu-repo/semantics/altIdentifier/issn/10778926","info:eu-repo/semantics/altIdentifier/arxiv/1808.04148","info:eu-repo/grantAgreement/EC/H2020/665385"],"description":["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."],"identifier":["https://research-explorer.ista.ac.at/record/6759","https://research-explorer.ista.ac.at/download/6759/6764"]},"publication":"Electronic Journal of Combinatorics","day":"19","has_accepted_license":"1","date_created":"2019-08-04T21:59:20Z","date_published":"2019-07-19T00:00:00Z","uri_base":"https://research-explorer.ista.ac.at"}]