Every K_{1,d}-free graph that excludes the k-ladder as an induced minor has tree-independence number bounded by a function of k and d.
[DMv24] Cl´ ement Dallard, Martin Milaniˇ c, and Kenny ˇStorgel
1 Pith paper cite this work, alongside 10 external citations. Polarity classification is still indexing.
1
Pith paper citing it
10
external citations · OpenAlex
fields
math.CO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
Every K_{1,d}-free graph that excludes the k-ladder as an induced minor has tree-independence number bounded by a function of k and d.