Skip to Main content Skip to Navigation
Conference papers

Branchwidth of Graphic Matroids

Stéphan Thomassé 1
1 ALGCO - Algorithmes, Graphes et Combinatoire
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : Branchwidth of Graphs and Matroids were introduced by Robertson and Seymour in their Graph Minor X paper. In 2002, Geelen, Gerards, Robertson and Whittle asked whether the branchwidth of a bridgeless graph is equal to the branchwidth of its cycle matroid. With Frederic Mazoit, we give a positive answer to this question. A straightforward corollary being that the branchwidth of a planar bridgeless graph is equal to the branchwidth of its dual.
Document type :
Conference papers
Complete list of metadata

Cited literature [6 references]  Display  Hide  Download
Contributor : Stephan Thomasse <>
Submitted on : Tuesday, October 7, 2008 - 4:29:04 PM
Last modification on : Thursday, February 7, 2019 - 4:53:17 PM
Long-term archiving on: : Monday, April 12, 2010 - 7:30:38 AM


Files produced by the author(s)


  • HAL Id : lirmm-00197155, version 1



Stéphan Thomassé. Branchwidth of Graphic Matroids. BCC'07: British Combinatorial Conference, United Kingdom. ⟨lirmm-00197155⟩



Record views


Files downloads