Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches

DOI10.1016/j.disc.2008.02.030zbMath1229.05153OpenAlexW2168941338MaRDI QIDQ1024454

Jan Arne Telle, Christophe Paul

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

zbMATH Keywords

graph decompositionchordalbranchwidthedge maximal

Mathematics Subject Classification ID

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

Related Items (1)

Maximum matching width: new characterizations and a fast algorithm for dominating set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. X: Obstructions to tree-decomposition
• On simple characterizations of k-trees
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Edge-maximal graphs of branchwidth k
• Graphs with Branchwidth at Most Three
• Algorithms – ESA 2005

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