We prove that for every $t\in \mathbb{N}$, there exists $τ=τ(t)\in \mathbb{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).
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。