H-induced minor detection is polynomial-time solvable for one 7-vertex tree and three 5-vertex graphs, completing the full classification for all 5-vertex H.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On Detecting $H$-Induced Minors for Small $H$
H-induced minor detection is polynomial-time solvable for one 7-vertex tree and three 5-vertex graphs, completing the full classification for all 5-vertex H.