Two tree-width-like graph invariants

DOI10.1007/S00493-003-0038-8zbMATH Open1056.05130OpenAlexW2130452056MaRDI QIDQ705708FDOQ705708

Hein van der Holst

Publication date: 14 February 2005

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-003-0038-8

zbMATH Keywords

manifoldgraph invariantgraph minortree decompositiontree width

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Graph minors (05C83)

Cited In (8)

• The rotational dimension of a graph
• Spectral characterization of tree-width-two graphs
• Tree width and regular triangulations
• Selected Open Problems in Discrete Geometry and Optimization
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
• Note on ``hook-length as a graph invariant of trees
• A new graph parameter related to bounded rank positive semidefinite matrix completions
• Positive semidefinite matrix completion, universal rigidity and the strong Arnold property

   Recommendations

• Spectral characterization of tree-width-two graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph 👍 👎
• Tree width and regular triangulations 👍 👎

This page was built for publication: Two tree-width-like graph invariants

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