| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4657535 | Journal of Combinatorial Theory, Series B | 2007 | 12 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
