On geometric independency trees for points in the plane

Atsushi Kaneko; Yoshiaki Oda; Kiyoshi Yoshimoto

doi:10.1016/S0012-365X(02)00264-9

On geometric independency trees for points in the plane

Atsushi Kaneko
, Yoshiaki Oda
, Kiyoshi Yoshimoto

研究成果: Article › 査読

1 被引用数 (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.

本文言語	English
ページ（範囲）	X93-104
ジャーナル	Discrete Mathematics
巻	258
号	1-3
DOI	https://doi.org/10.1016/S0012-365X(02)00264-9
出版ステータス	Published - 2002 12月 6
外部発表	はい

ASJC Scopus subject areas

理論的コンピュータサイエンス
離散数学と組合せ数学

文献へのアクセス

10.1016/S0012-365X(02)00264-9

他のファイルとリンク

引用スタイル

@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 = dec,

day = "6",

doi = "10.1016/S0012-365X(02)00264-9",

language = "English",

volume = "258",

pages = "X93--104",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier B.V.",

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 - https://www.scopus.com/pages/publications/0037032974

UR - https://www.scopus.com/pages/publications/0037032974#tab=citedBy

U2 - 10.1016/S0012-365X(02)00264-9

DO - 10.1016/S0012-365X(02)00264-9

M3 - Article

AN - SCOPUS:0037032974

SN - 0012-365X

VL - 258

SP - X93-104

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 1-3

ER -

On geometric independency trees for points in the plane

抄録

ASJC Scopus subject areas

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル