### 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.

Original language | English |
---|---|

Pages (from-to) | 93-104 |

Number of pages | 12 |

Journal | Discrete Mathematics |

Volume | 258 |

Issue number | 1-3 |

Publication status | Published - 2002 Dec 6 |

Externally published | Yes |

### Fingerprint

### Keywords

- A geometric graph
- A spanning tree
- Discrete geometry

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Theoretical Computer Science

### Cite this

*Discrete Mathematics*,

*258*(1-3), 93-104.

**On geometric independency trees for points in the plane.** / Kaneko, Atsushi; Oda, Yoshiaki; Yoshimoto, Kiyoshi.

Research output: Contribution to journal › Article

*Discrete Mathematics*, vol. 258, no. 1-3, pp. 93-104.

}

TY - JOUR

T1 - On geometric independency trees for points in the plane

AU - Kaneko, Atsushi

AU - Oda, Yoshiaki

AU - Yoshimoto, Kiyoshi

PY - 2002/12/6

Y1 - 2002/12/6

N2 - 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.

AB - 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.

KW - A geometric graph

KW - A spanning tree

KW - Discrete geometry

UR - http://www.scopus.com/inward/record.url?scp=0037032974&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0037032974&partnerID=8YFLogxK

M3 - Article

VL - 258

SP - 93

EP - 104

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -