The branchwidth of graphs and their cycle matroids

Authors:
Illya V. Hicks;Nolan B. McMurray, Jr.
Affiliations:
Industrial and Systems Engineering Department, Texas A & M University, College Station, TX 77843-3131, USA;Department of Mathematics and Statistics, University of North Carolina at Wilmington, 601 S. College Road, Wilmington, NC 28403, USA
Venue:
Journal of Combinatorial Theory Series B
Year:
2007

Citing 2
Cited 7

Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Graph minors. XI.: circuits on a surface

Journal of Combinatorial Theory Series B

Approximating rank-width and clique-width quickly

ACM Transactions on Algorithms (TALG)
On minimal tree realizations of linear codes

IEEE Transactions on Information Theory
Finding branch-decompositions and rank-decompositions

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Monadic second-order model-checking on decomposable matroids

Discrete Applied Mathematics
Note: On self-duality of branchwidth in graphs of bounded genus

Discrete Applied Mathematics
Improving the accuracy of linear programming solvers with iterative refinement

Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming

INFORMS Journal on Computing

Quantified Score

Hi-index	0.06

Visualization

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.