Graphs with Branchwidth at Most Three

DOI10.1006/JAGM.1999.1011MaRDI QIDQ4264493zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Dimitrios M. Thilikos, Hans L. Bodlaender

Publication date 17 October 2000

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/2734

zbMATH Keywords

branchwidthreduction rule

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Recommendations

• Constructive linear time algorithms for branchwidth
• scientific article; zbMATH DE number 1304318
• Generation of Graphs with Bounded Branchwidth
• Algorithms – ESA 2005
• Practical algorithms for branch-decompositions of planar graphs

Cited in

(17)

• Edge-maximal graphs of branchwidth k: The k-branches
• Algorithms and obstructions for linear-width and related search parameters
• Computing the branchwidth of interval graphs
• Strong branchwidth and local transversals
• Minor obstructions for apex-pseudoforests
• Sparse obstructions for minor-covering parameters
• Characterizing graphs of maximum matching width at most 2
• Characterizing graphs of small carving-width
• On strict brambles
• Forbidding Kuratowski graphs as immersions
• Minor-minimal planar graphs of even branch-width
• Edge-maximal graphs of branchwidth k
• Generation of Graphs with Bounded Branchwidth
• k-apices of minor-closed graph classes. I: Bounding the obstructions
• Tangle bases: Revisited
• Graph parameters, universal obstructions, and WQO
• Branchwidth of chordal graphs

This page was built for publication: Graphs with Branchwidth at Most Three

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