We prove a conjecture of Seymour (1993) stating that for every apex-forest H-1 and outerplanar graph H-2 there is an integer p such that every 2-connected graph of pathwidth at least p contains H-1 or H-2 as a minor. An independent proof was recently obtained by Dang and Thomas [3].
机构:
Jiangxi Univ Sci & Technol, Fac Sci, Ganzhou, Peoples R ChinaJiangxi Univ Sci & Technol, Fac Sci, Ganzhou, Peoples R China
Feng, Xing
Ge, Jun
论文数: 0引用数: 0
h-index: 0
机构:
Sichuan Normal Univ, Sch Math Sci, Chengdu, Sichuan, Peoples R China
Sichuan Normal Univ, Laurent Math Ctr, Chengdu, Sichuan, Peoples R ChinaJiangxi Univ Sci & Technol, Fac Sci, Ganzhou, Peoples R China