Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1016/S0012-365X(02)00264-9 | Discrete Mathematics |
Keywords | Field | DocType |
Discrete geometry,A geometric graph,A spanning tree | Discrete mathematics,Geometric graph theory,Combinatorics,Minimum degree spanning tree,k-minimum spanning tree,Euclidean minimum spanning tree,Spanning tree,Segment tree,Multiple edges,Mathematics,Minimum spanning tree | Journal |
Volume | Issue | ISSN |
258 | 1 | 0012-365X |
Citations | PageRank | References |
1 | 0.41 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Atsushi Kaneko | 1 | 169 | 24.21 |
| Yoshiaki Oda | 2 | 46 | 7.30 |
| Kiyoshi Yoshimoto | 3 | 133 | 22.65 |