{
  "abstract": "Given a set P of paths over a graph (called the host graph), its edge intersection graph is a graph each of whose vertices corresponds to a path in P and where two vertices are connected if and only if the paths they correspond to share at least one edge. Restricting the host graph to trees gives the class of edge intersection graphs of paths in trees (EPT graphs), first introduced in [Golumbic, Jamison (1985) and Monma, Wei (1986)]. EPT graphs are a natural generalization of interval graphs but, in contrast to the latter, characterizing EPT graphs by minimal forbidden induced subgraphs remains an open problem. In this contribution, we prove that certain stretching operations preserve the property of not being EPT. We further introduce new families of minimal non-EPT graphs, constructed from known chordal minimal non-EPT graphs through the presented stretching operations, and study general necessary conditions for these to preserve the minimality when applied to minimal non-EPT graphs.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 3,
  "authors": [
    {
      "name": "Mariana Escalante"
    },
    {
      "name": "Victoria Kaial"
    },
    {
      "name": "Annegret K Wagler"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/5f0gdgw0fbpeb.bib",
  "cited_by": 0,
  "doi": null,
  "fulltext_url": null,
  "id": "5f0gdgw0fbpeb",
  "issns": [],
  "landing_url": "https://hal.science/hal-05752060v1",
  "language": "en",
  "licence": "CC-BY-NC-ND-4.0",
  "licence_label": "CC BY-NC-ND 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by-nc-nd/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "hal",
      "0.info"
    ],
    [
      "hal",
      "0.math"
    ],
    [
      "hal",
      "1.info.info-dm"
    ],
    [
      "hal",
      "1.math.math-co"
    ]
  ],
  "openalex": null,
  "pdf_url": "https://hal.science/hal-05752060/document",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-16",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/5f0gdgw0fbpeb.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:35Z",
      "native_id": "hal-05752060",
      "source": "hal",
      "url": "https://hal.science/hal-05752060v1"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "hal:1.math.math-co",
      "subfield": "combinatorics"
    }
  ],
  "title": "Some advances on stretching operations applied to cliques of edge intersection graphs of paths in trees",
  "title_text": "Some advances on stretching operations applied to cliques of edge intersection graphs of paths in trees",
  "type": "preprint",
  "updated_at": "2026-10-30T12:17:35Z",
  "url": "https://research.draconitic.com/paper/5f0gdgw0fbpeb",
  "venue": "HAL",
  "versions": []
}