On geometric independency trees for points in the plane

Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto

Research output: Contribution to journalArticle

1 Citation (Scopus)

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 languageEnglish
Pages (from-to)93-104
Number of pages12
JournalDiscrete Mathematics
Volume258
Issue number1-3
Publication statusPublished - 2002 Dec 6
Externally publishedYes

Fingerprint

Line segment
Spanning tree
Collinear
Intersect
Straight Line
Closed
Graph in graph theory

Keywords

  • A geometric graph
  • A spanning tree
  • Discrete geometry

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Kaneko, A., Oda, Y., & Yoshimoto, K. (2002). On geometric independency trees for points in the plane. Discrete Mathematics, 258(1-3), 93-104.

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

In: Discrete Mathematics, Vol. 258, No. 1-3, 06.12.2002, p. 93-104.

Research output: Contribution to journalArticle

Kaneko, A, Oda, Y & Yoshimoto, K 2002, 'On geometric independency trees for points in the plane', Discrete Mathematics, vol. 258, no. 1-3, pp. 93-104.
Kaneko, Atsushi ; Oda, Yoshiaki ; Yoshimoto, Kiyoshi. / On geometric independency trees for points in the plane. In: Discrete Mathematics. 2002 ; Vol. 258, No. 1-3. pp. 93-104.
@article{5855897f4f29459899d6a9c5b66fda68,
title = "On geometric independency trees for points in the plane",
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.",
keywords = "A geometric graph, A spanning tree, Discrete geometry",
author = "Atsushi Kaneko and Yoshiaki Oda and Kiyoshi Yoshimoto",
year = "2002",
month = "12",
day = "6",
language = "English",
volume = "258",
pages = "93--104",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

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 -