Edge-maximal graphs of branchwidth k

DOI10.1016/J.ENDM.2005.06.075MaRDI QIDQ3439366zbMATH OpenOpenAlexFDO

Authors Christophe Paul, Jan Arne Telle

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2005.06.075

zbMATH Keywords

graphtree-decompositionwidth parameters

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• Edge-maximal graphs of branchwidth k: The k-branches
• Generation of Graphs with Bounded Branchwidth
• The size of strength‐maximal graphs
• Strong branchwidth and local transversals
• On the excluded minors for the matroids of branch-width \(k\)

Cites work

• Algorithms – ESA 2005
• Graph minors. X: Obstructions to tree-decomposition
• Graphs with Branchwidth at Most Three
• On simple characterizations of k-trees

Cited in

(5)

• Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches
• Generation of Graphs with Bounded Branchwidth
• 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

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