抄録
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.
本文言語 | English |
---|---|
ページ(範囲) | X93-104 |
ジャーナル | Discrete Mathematics |
巻 | 258 |
号 | 1-3 |
DOI | |
出版ステータス | Published - 2002 12月 6 |
外部発表 | はい |
ASJC Scopus subject areas
- 理論的コンピュータサイエンス
- 離散数学と組合せ数学