Tree Independence Number III. Thetas, Prisms and Stars

Read full text
Authors: Maria Chudnovsky, Sepehr Hajebi, Nicolas Trotignon
Cited by: 1
References: 12

Abstract

ABSTRACT We prove that for every there exists such that every (theta, prism, )‐free graph has tree independence number at most (where we allow “prisms” to have one path of length zero).

Fields of Study & Subjects

Mathematics and Applications

Publication details

Journal / source
Journal of Graph Theory
Publisher
Wiley
Volume
113
Issue
4
Pages
619-633
Publication date
17 June 2026
Language
EN