{
  "abstract": "We prove that for every t ∈ N there exists τ = τ (t) ∈ N such that every (theta, prism, K 1,t )-free graph has tree independence number at most τ (where we allow \"prisms\" to have one path of length zero).",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": null,
  "author_total": 3,
  "authors": [
    {
      "name": "Maria Chudnovsky"
    },
    {
      "name": "Sepehr Hajebi"
    },
    {
      "name": "Nicolas Trotignon"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/dzmn67255kvjm.bib",
  "cited_by": 2,
  "doi": "10.1002/jgt.70088",
  "fulltext_url": null,
  "id": "dzmn67255kvjm",
  "issns": [
    "0364-9024",
    "1097-0118"
  ],
  "landing_url": "https://hal.science/hal-05763869v1",
  "language": "en",
  "licence": "CC-BY-NC-4.0",
  "licence_label": "CC BY-NC 4.0",
  "licence_source": "article",
  "licence_url": "https://creativecommons.org/licenses/by-nc/4.0/",
  "metadata_licence": null,
  "native_subjects": [
    [
      "hal",
      "0.info"
    ],
    [
      "hal",
      "0.math"
    ],
    [
      "openalex",
      "1703|Advanced Graph Theory Research"
    ]
  ],
  "openalex": "W4399912319",
  "pdf_url": "https://hal.science/hal-05763869/document",
  "pmcid": null,
  "pmid": null,
  "published": "2026-06-17",
  "publisher": "Wiley",
  "ris": "https://research.draconitic.com/paper/dzmn67255kvjm.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:17:40Z",
      "native_id": "hal-05763869",
      "source": "hal",
      "url": "https://hal.science/hal-05763869v1"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "journal-openalex:2607|Limits and Structures in Graph Theory",
      "subfield": "combinatorics"
    }
  ],
  "title": "Tree Independence Number III. Thetas, Prisms and Stars",
  "title_text": "Tree Independence Number III. Thetas, Prisms and Stars",
  "type": "peer-reviewed",
  "updated_at": "2026-10-30T12:17:40Z",
  "url": "https://research.draconitic.com/paper/dzmn67255kvjm",
  "venue": "Journal of Graph Theory",
  "versions": []
}