{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T04:29:39Z","timestamp":1766377779185,"version":"3.41.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We analyse properties of geometric intersection graphs to show the strict containment between some natural classes of geometric intersection graphs. In particular, we show the following properties:A graph $G$ is outerplanar if and only if the 1-subdivision of $G$ is outer-segment.For each integer $k\\ge 1$, the class of intersection graphs of segments with $k$ different lengths is a strict subclass of the class of intersection graphs of segments with $k+1$ different lengths.For each integer $k\\ge 1$, the class of intersection graphs of disks with $k$ different sizes is a strict subclass of the class of intersection graphs of disks with $k+1$ different sizes.The class of outer-segment graphs is a strict subclass of the class of outer-string graphs.<\/jats:p>","DOI":"10.37236\/6040","type":"journal-article","created":{"date-parts":[[2020,1,10]],"date-time":"2020-01-10T19:20:21Z","timestamp":1578684021000},"source":"Crossref","is-referenced-by-count":7,"title":["Refining the Hierarchies of Classes of Geometric Intersection Graphs"],"prefix":"10.37236","volume":"24","author":[{"given":"Sergio","family":"Cabello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miha","family":"Jej\u010di\u010d","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2017,2,17]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p33\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v24i1p33\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T05:05:14Z","timestamp":1579237514000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v24i1p33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,17]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2017,1,20]]}},"URL":"https:\/\/doi.org\/10.37236\/6040","relation":{},"ISSN":["1077-8926"],"issn-type":[{"type":"electronic","value":"1077-8926"}],"subject":[],"published":{"date-parts":[[2017,2,17]]},"article-number":"P1.33"}}