Note
Tree width and regular triangulations

https://doi.org/10.1016/S0012-365X(00)00102-3Get rights and content
Under an Elsevier user license
open archive

Abstract

Consider the regular triangulation of an equilateral triangle into (k−1)2 congruent triangles. Define the graph Δk as the skeleton of this triangulation. Recently, using spectral methods, Colin de Verdière showed that the tree width of Δk is k. In this note, we show that Δk is, in fact, a forbidden minor for the property of having tree width less than k. As a corollary, we derive a similar result for a spectral graph invariant.

Keywords

Tree width
Colin de Verdiere number
Forbidden minor

Cited by (0)