The branchwidth of graphs and their cycle matroids

We prove a conjecture stating that the branchwidth of a graph and the branchwidth of the graphʹs cycle matroid are equal if the graph has a cycle of length at least 2.