bienstock1991quickly (219B)
1 # bienstock1991quickly 2 3 They show that for every [forest] F with n vertices, a graph with [pathwidth] at least n-1 has a [minor] which is [graph_isomorphic] to F 4 5 Up: [academic_paper], [obstruction_treewidth_pathwidth]