scientific article; zbMATH DE number 7731184

zbMath1519.05212arXiv2203.14036MaRDI QIDQ6134965

Klaus Metsch

Publication date: 23 August 2023

Full work available at URL: https://arxiv.org/abs/2203.14036

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

lower bound for the treewidthtree decomposition of a graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
• The treewidth of line graphs
• The exact bound in the Erdős-Ko-Rado theorem
• On the treewidth of Hanoi graphs
• Treewidth of the generalized Kneser graphs
• Treewidth is a lower bound on graph gonality
• Graph minors. II. Algorithmic aspects of tree-width
• The treewidth of 2-section of hypergraphs
• Treewidth of the Line Graph of a Complete Graph
• The Size Ramsey Number of Graphs with Bounded Treewidth

This page was built for publication: