Key points are not available for this paper at this time.
We prove that for every t N there exists = (t) N such that every (theta, prism, K₁, ₓ) -free graph has tree independence number at most (where we allow "prisms" to have one path of length zero).
Chudnovsky et al. (Tue,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: