Bounding branch-width

DOI10.37236/11162zbMath1519.05203MaRDI QIDQ6133165

Jasmine Lulani Kaulamatoa, Geoffrey P. Whittle, Susan Jowett

Publication date: 18 August 2023

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

zbMATH Keywords

polynomial-time algorithmscarving-width

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors XXIII. Nash-Williams' immersion conjecture
• Graph minors. X: Obstructions to tree-decomposition
• Call routing and the ratcatcher
• On the excluded minors for the matroids of branch-width \(k\)
• Branch-width and well-quasi-ordering in matroids and graphs.
• Recognising graphic and matroidal connectivity functions
• Characterizing graphs of small carving-width
• The branchwidth of graphs and their cycle matroids

This page was built for publication: Bounding branch-width