{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T06:24:17Z","timestamp":1776839057304,"version":"3.51.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We consider the graph classes Grounded-L and Grounded-{\ud835\uddab,\u2143} corresponding to graphs that admit an\u00a0intersection representation by \ud835\uddab-shaped curves (or \ud835\uddab-shaped and \u2143-shaped curves, respectively), 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 these classes to related intersection classes, such as the grounded segment graphs, the monotone \ud835\uddab-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.<\/jats:p>","DOI":"10.37236\/8096","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T07:05:04Z","timestamp":1578639904000},"source":"Crossref","is-referenced-by-count":8,"title":["On Grounded L-Graphs and their Relatives"],"prefix":"10.37236","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4831-4079","authenticated-orcid":false,"given":"V\u00edt","family":"Jel\u00ednek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5036-2136","authenticated-orcid":false,"given":"Martin","family":"T\u00f6pfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2019,7,19]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i3p17\/7877","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v26i3p17\/7877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T04:11:14Z","timestamp":1579234274000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v26i3p17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,19]]},"references-count":0,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2019,7,4]]}},"URL":"https:\/\/doi.org\/10.37236\/8096","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,19]]},"article-number":"P3.17"}}