scientific article; zbMATH DE number 7731184

MaRDI QIDQ6134965zbMATH OpenFDO

Authors Klaus Metsch

Publication date 23 August 2023

Full work available at URL https://arxiv.org/abs/2203.14036, http://ajc.maths.uq.edu.au/pdf/86/ajc_v86_p477.pdf

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)

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

Cites work

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

Cited in

(9)

• A partial k-arboretum of graphs with bounded treewidth
• Treewidth of the generalized Kneser graphs
• A generalization of Kneser graphs
• Treewidth of the Kneser graph and the Erdős-Ko-Rado theorem
• Treewidth of the \(q\)-Kneser graphs
• Kneser graphs are Hamiltonian
• On the treewidth of Hanoi graphs
• On the treewidth of generalized q-Kneser graphs
• Kneser graphs are Hamiltonian

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)