scientific article; zbMATH DE number 7731184

zbMATH Open1519.05212arXiv2203.14036MaRDI QIDQ6134965FDOQ6134965

Klaus Metsch

Publication date: 23 August 2023

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

Title of this publication is not available (Why is that?)

Recommendations

• Treewidth of the generalized Kneser graphs
• Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
• The odd girth of the generalised Kneser graph
• On the diameter of generalized Kneser graphs
• On the chromatic number of generalized Kneser hypergraphs

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

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

Cited In (5)

• A partial k-arboretum of graphs with bounded treewidth
• Kneser graphs are Hamiltonian
• Treewidth of the generalized Kneser graphs
• A generalization of Kneser graphs
• On the treewidth of Hanoi graphs

This page was built for publication:

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