Edge-maximal graphs of branchwidth k

DOI10.1016/J.ENDM.2005.06.075zbMATH Open1200.05194OpenAlexW2079159212MaRDI QIDQ3439366FDOQ3439366

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

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\)

zbMATH Keywords

graphtree-decompositionwidth parameters

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Title not available (Why is that?)
• Edge-maximal graphs of branchwidth \(k\): The \(k\)-branches
• 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

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