Branchwidth of graphic matroids.

Abstract

Answering a question of Geelen, Gerards, Robertson and Whittle, we prove that the branchwidth of a bridgeless graph is equal to the branch- width of its cycle matroid. Our proof is based on branch-decompositions of hypergraph