Branchwidth of Graphic Matroids - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2007

Branchwidth of Graphic Matroids

Stéphan Thomassé


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.
Fichier principal
Vignette du fichier
Branchwidthbcc-pdf.pdf (150.63 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00197155 , version 1 (07-10-2008)


  • HAL Id : lirmm-00197155 , version 1


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


Gmail Mastodon Facebook X LinkedIn More