On geometric independency trees for points in the plane
type: Item
instance of: scholarly article
title: On geometric independency trees for points in the plane
zbMATH Open document ID: 1030.05035
DOI: 10.1016/S0012-365X(02)00264-9
author: Atsushi Kaneko
author: Yoshiaki Oda
author: Kiyoshi Yoshimoto
published in: Discrete Mathematics
publication date: 2002-12-02T00:00:00Z
review text: A geometric graph is a graph drawn in the plane whose edges are straight-line segments. A plane spanning tree is a tree drawn in the plane so that its edges are closed straight-line segments and no two edges intersect internally, and no three of its vertices are collinear. This type of tree has been frequently studied, because its importance in computer science. This paper presents some interesting results about particular plane spanning trees.
reviewed by: Alain Bretto
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 1839024
zbMATH Keywords: geometric graph
zbMATH Keywords: plane spanning tree
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 1839024