---
res:
  bibo_abstract:
  - "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.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Vít
      foaf_name: Jelínek, Vít
      foaf_surname: Jelínek
  - foaf_Person:
      foaf_givenName: Martin
      foaf_name: Töpfer, Martin
      foaf_surname: Töpfer
      foaf_workInfoHomepage: http://www.librecat.org/personId=4B865388-F248-11E8-B48F-1D18A9856A87
  bibo_doi: 10.37236/8096
  bibo_issue: '3'
  bibo_volume: 26
  dct_date: 2019^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/1077-8926
  dct_language: eng
  dct_publisher: Electronic Journal of Combinatorics@
  dct_title: On grounded L-graphs and their relatives@
...