Edge-maximal graphs of branchwidth k: The k-branches

DOI10.1016/J.DISC.2008.02.030zbMATH Open1229.05153OpenAlexW2168941338MaRDI QIDQ1024454FDOQ1024454

Authors: Christophe Paul, Jan Arne Telle 

Publication date: 17 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.02.030

Recommendations

• Edge-maximal graphs of branchwidth k
• Generation of Graphs with Bounded Branchwidth
• Algorithms – ESA 2005
• Strong branchwidth and local transversals
• Branchwidth of chordal graphs

zbMATH Keywords

graph decompositionchordalbranchwidthedge maximal

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Connectivity (05C40)

Cites Work

• Graph minors. X: Obstructions to tree-decomposition
• Title not available (Why is that?)
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• On simple characterizations of k-trees
• Title not available (Why is that?)
• Graphs with Branchwidth at Most Three
• Algorithms – ESA 2005
• Edge-maximal graphs of branchwidth k
• Title not available (Why is that?)

Cited In (7)

• Edge-maximal graphs of branchwidth k
• Title not available (Why is that?)
• Strong branchwidth and local transversals
• Maximum matching width: new characterizations and a fast algorithm for dominating set
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generation of Graphs with Bounded Branchwidth

This page was built for publication: Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches

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