Bounding branch-width

DOI10.37236/11162MaRDI QIDQ6133165zbMATH OpenFDO

Authors Susan Jowett, Jasmine Lulani Kaulamatoa, Geoff Whittle

Publication date 18 August 2023

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.37236/11162

zbMATH Keywords

carving-widthpolynomial-time algorithms

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Testing branch-width
• Bounding connected tree-width
• Bounds for Width Two Branching Programs
• scientific article; zbMATH DE number 1990711
• Branchwidth of chordal graphs
• Treewidth lower bounds with brambles
• Algorithms – ESA 2005
• Girth and treewidth
• Rank‐width is less than or equal to branch‐width
• Tree-width dichotomy

Cites work

• Branch-width and well-quasi-ordering in matroids and graphs.
• Branchwidth of graphic matroids
• Call routing and the ratcatcher
• Characterizing graphs of small carving-width
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Graph minors. X: Obstructions to tree-decomposition
• scientific article; zbMATH DE number 3777562 (Why is no real title available?)
• scientific article; zbMATH DE number 5873618 (Why is no real title available?)
• On the excluded minors for the matroids of branch-width \(k\)
• Recognising graphic and matroidal connectivity functions
• The branchwidth of graphs and their cycle matroids

Cited in

(2)

• scientific article; zbMATH DE number 1304318 (Why is no real title available?)
• Testing branch-width

This page was built for publication: Bounding branch-width

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