Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Branchwidth of graphic matroids.

Frédéric Mazoit 1 Stéphan Thomassé 2
2 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Complete list of metadatas

Cited literature [6 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00012312
Contributor : Frédéric Mazoit <>
Submitted on : Wednesday, October 19, 2005 - 6:38:27 PM
Last modification on : Thursday, March 5, 2020 - 12:20:18 PM
Document(s) archivé(s) le : Thursday, April 1, 2010 - 10:50:24 PM

Identifiers

  • HAL Id : hal-00012312, version 1

Collections

Citation

Frédéric Mazoit, Stéphan Thomassé. Branchwidth of graphic matroids.. 2005. ⟨hal-00012312⟩

Share

Metrics

Record views

264

Files downloads

427