Tree width and regular triangulations

DOI10.1016/S0012-365X(00)00102-3MaRDI QIDQ5939925zbMATH OpenOpenAlexFDO

Authors Andreĭ V. Kotlov

Publication date 28 November 2001

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(00)00102-3

zbMATH Keywords

Colin de Verdière numberforbidden minortree width

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph minors (05C83)

Recommendations

• On the ?largeur d'arborescence?
• Spectral characterization of tree-width-two graphs
• scientific article; zbMATH DE number 772777
• scientific article; zbMATH DE number 4144031
• Two tree-width-like graph invariants

Cited in

(6)

• Trees in triangulations
• On the ?largeur d'arborescence?
• Tree-width and circumference of graphs
• Spectral characterization of tree-width-two graphs
• Two tree-width-like graph invariants
• Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope

This page was built for publication: Tree width and regular triangulations

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