Unavoidable Cycle-Contraction Minors of Large 2-Connected Graphs | SIAM Journal on Discrete...
Abstract. It is well known that every sufficiently large connected graph has, as an induced subgraph, , , or an -vertex path. A 2023 paper of Allred, Ding, and Oporowski identified a set of unavoid...
epubs.siam.org