On the bandwidth of triangulated triangles
type: Item
instance of: scholarly article
title: On the bandwidth of triangulated triangles
zbMATH Open document ID: 0823.05048
DOI: 10.1016/0012-365X(94)00208-Z
published in: Discrete Mathematics
publication date: 1995-10-23T00:00:00Z
review text: The three authors give a technique for obtaining a lower bound on the bandwidth of any planar graph \(G\) by proving that if \(G\) is a plane near- triangulation and \(v_ 1\), \(v_ 2\), \(v_ 3\) are three mutually distinct vertices on the exterior face, the bandwidth of \(G\) is at least as large as the smallest connecting set with respect to \(v_ 1\), \(v_ 2\), \(v_ 3\).
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 744017
zbMATH Keywords: triangulated triangles
zbMATH Keywords: bandwidth
zbMATH Keywords: planar graph
author: Robert A. Hochberg
author: Colin McDiarmid
author: Michael Saks
reviewed by: Rainer Bodendiek
MaRDI profile type: Publication
cites work: Q5422499
cites work: Optimal labelling of a product of two paths
cites work: Q3789621
cites work: Optimal numberings and isoperimetric problems on graphs
cites work: Q3138968
full work available at URL: 0012-365x(94)00208-z
OpenAlex ID: W2091052948
description: scientific article; zbMATH DE number 744017