Circumference and Pathwidth of Highly Connected Graphs
Circumference and Pathwidth of Highly Connected Graphs
Abstract Birmele [ J Graph Theory 2003] proved that every graph with circumference t has treewidth at most . Under the additional assumption of 2‐connectivity, such graphs have bounded pathwidth, which is a qualitatively stronger conclusion. Birmele's theorem was extended by Birmele et al. [ Combinatorica 2007] who showed that …