Generation of Graphs with Bounded Branchwidth

DOI10.1007/11917496_19MaRDI QIDQ3522958zbMATH OpenOpenAlexFDO

Authors Christophe Paul, Andrzej Proskurowski, Jan Arne Telle

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11917496_19

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Edge-maximal graphs of branchwidth k: The k-branches
• Edge-maximal graphs of branchwidth k
• Algorithms – ESA 2005
• Constructive linear time algorithms for branchwidth
• Graphs with Branchwidth at Most Three

Cited in

(6)

• Edge-maximal graphs of branchwidth k: The k-branches
• Generating applicable synthetic instances for branch problems
• Edge-maximal graphs of branchwidth k
• Constant Time Generation of Biconnected Rooted Plane Graphs
• Graphs with Branchwidth at Most Three
• A Family of Tree-Based Generators for Bubbles in Directed Graphs

This page was built for publication: Generation of Graphs with Bounded Branchwidth

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