K_{1,d}-free graphs without an induced wheel minor W_ℓ have tree-independence number bounded by an explicit function of d and ℓ.
Treewidth versus clique number: induced minors
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We prove that a hereditary class of graphs is $(\mathsf{tw}, \omega)$-bounded if and only if the induced minors of the graphs from the class form a $(\mathsf{tw}, \omega)$-bounded class.
citation-role summary
background 1
citation-polarity summary
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Excluding an induced wheel minor in graphs without large induced stars
K_{1,d}-free graphs without an induced wheel minor W_ℓ have tree-independence number bounded by an explicit function of d and ℓ.