Published October 19, 2005 | Version v1
Publication

Branchwidth of graphic matroids.

Contributors

Others:

Description

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.

Additional details

Identifiers

URL
https://hal.archives-ouvertes.fr/hal-00012312
URN
urn:oai:HAL:hal-00012312v1

Origin repository

Origin repository
UNICA