Two tree-width-like graph invariants

DOI10.1007/S00493-003-0038-8MaRDI QIDQ705708zbMATH OpenOpenAlexFDO

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

Recommendations

• Spectral characterization of tree-width-two graphs
• Hypertree-width and related hypergraph invariants
• scientific article; zbMATH DE number 772777
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Tree width and regular triangulations

Cited in

(8)

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

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)