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.

Saved in:
Bibliographic Details
Published in:Journal of combinatorial theory. Series B 2007-09, Vol.97 (5), p.681-692
Main Authors: Hicks, Illya V., McMurray, Nolan B.
Format: Article
Language:English
Subjects:
Branch decomposition
Cycle matroid
Graph
Tangle
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0095-8956
1096-0902
DOI:10.1016/j.jctb.2006.12.007