The branchwidth of graphs and their cycle matroids

DOI10.1016/J.JCTB.2006.12.007zbMATH Open1121.05026OpenAlexW2058685100MaRDI QIDQ2642007FDOQ2642007

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

Recommendations

• Branchwidth of graphic matroids
• Obstructions for bounded branch-depth in matroids
• Matroid tree-width
• On the excluded minors for the matroids of branch-width \(k\)
• On the interplay between graphs and matroids

zbMATH Keywords

graphtanglecycle matroidbranch decomposition

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Graph minors. X: Obstructions to tree-decomposition
• Call routing and the ratcatcher
• Branch-width and well-quasi-ordering in matroids and graphs.
• Graph minors. XI: Circuits on a surface
• Title not available (Why is that?)

Cited In (25)

• Outerplanar obstructions for matroid pathwidth
• The Branch-Width of Circular-Arc Graphs
• On self-duality of branchwidth in graphs of bounded genus
• Monadic second-order model-checking on decomposable matroids
• Excluding a bipartite circle graph from line graphs
• The extremal functions of classes of matroids of bounded branch-width
• Branch decomposition heuristics for linear matroids
• Branchwidth of graphic matroids
• Kernelization using structural parameters on sparse graph classes
• Connectivity functions and polymatroids
• Branchings in rooted graphs and the diameter of greedoids
• Tangle bases: Revisited
• Bounding branch-width
• Branch-depth: generalizing tree-depth of graphs
• Finding branch-decompositions of matroids, hypergraphs, and more
• Rank-width: algorithmic and structural results
• A tight relation between series-parallel graphs and bipartite distance hereditary graphs
• Iterative refinement for linear programming
• Outerplanar obstructions for matroid pathwidth
• Vertex-minors of graphs: a survey
• Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs
• Title not available (Why is that?)
• Obstructions for Bounded Branch-depth in Matroids
• Minors in graphs of large \(\theta_r\)-girth
• Branchwidth is \((1, g)\)-self-dual

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642007)