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

DOI10.1016/J.DISC.2008.02.030MaRDI QIDQ1024454zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

graph decompositionchordalbranchwidthedge maximal

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 4008410 (Why is no real title available?)
• scientific article; zbMATH DE number 1304318 (Why is no real title available?)
• scientific article; zbMATH DE number 1361465 (Why is no real title available?)
• Algorithms – ESA 2005
• Edge-maximal graphs of branchwidth k
• Graph minors. X: Obstructions to tree-decomposition
• Graphs with Branchwidth at Most Three
• On simple characterizations of k-trees
• The intersection graphs of subtrees in trees are exactly the chordal graphs

Cited in

(7)

• Maximum matching width: new characterizations and a fast algorithm for dominating set
• Edge-maximal graphs of branchwidth k
• Generation of Graphs with Bounded Branchwidth
• Strong branchwidth and local transversals
• scientific article; zbMATH DE number 6837056 (Why is no real title available?)
• scientific article; zbMATH DE number 7029068 (Why is no real title available?)
• scientific article; zbMATH DE number 3929050 (Why is no real title available?)

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)