The branchwidth of graphs and their cycle matroids

DOI10.1016/j.jctb.2006.12.007zbMath1121.05026OpenAlexW2058685100MaRDI QIDQ2642007

Nolan McMurray, Illya V. Hicks

Publication date: 20 August 2007

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2006.12.007

zbMATH Keywords

graphtanglecycle matroidbranch decomposition

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (17)

A tight relation between series-parallel graphs and bipartite distance hereditary graphs ⋮ Kernelization using structural parameters on sparse graph classes ⋮ Minors in graphs of large \(\theta_r\)-girth ⋮ Rank-width: algorithmic and structural results ⋮ Outerplanar obstructions for matroid pathwidth ⋮ Tangle bases: Revisited ⋮ On self-duality of branchwidth in graphs of bounded genus ⋮ Branchwidth is \((1, g)\)-self-dual ⋮ Bounding branch-width ⋮ Branch decomposition heuristics for linear matroids ⋮ Branch-depth: generalizing tree-depth of graphs ⋮ Obstructions for Bounded Branch-depth in Matroids ⋮ Monadic second-order model-checking on decomposable matroids ⋮ Unnamed Item ⋮ Excluding a bipartite circle graph from line graphs ⋮ Connectivity functions and polymatroids ⋮ Iterative Refinement for Linear Programming

Cites Work

• Unnamed Item
• Graph minors. X: Obstructions to tree-decomposition
• Graph minors. XI: Circuits on a surface
• Call routing and the ratcatcher
• Branch-width and well-quasi-ordering in matroids and graphs.

This page was built for publication: The branchwidth of graphs and their cycle matroids