On geometric independency trees for points in the plane

Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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. In this paper, we present several results on a plane spanning tree T such that the graph obtained from T by adding a line segment between any two end-vertices of T is self-intersecting.

Original languageEnglish
Pages (from-to)X93-104
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - 2002 Dec 6
Externally publishedYes


  • A geometric graph
  • A spanning tree
  • Discrete geometry

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'On geometric independency trees for points in the plane'. Together they form a unique fingerprint.

Cite this