For every positive integer k, any graph that contains an induced path on k vertices also contains an avoidable induced path on k vertices.
On rigid circuit graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Avoidable paths in graphs
For every positive integer k, any graph that contains an induced path on k vertices also contains an avoidable induced path on k vertices.