2023-09-28T05:29:25Z
https://u-ryukyu.repo.nii.ac.jp/oai
oai:u-ryukyu.repo.nii.ac.jp:02000877
2023-08-03T05:36:20Z
1642838163960:1642838338003
1642838403551:1642838405037
Plane graphs with straight edges whose bounded faces are acute triangles
Maehara, Hiroshi
Let $T_n$ denote a graph obtained as a triangulation of an $n$-gon in the plane. A cycle of $T_n$ is called an enclosing cycle if at least one vertex lies inside the cycle. In this paper it is proved that a triangulation $T_n$ admits a straight-line embedding in the plane whose bounded faces are all acute triangles if and only if $T_n$ has no enclosing cycle of length $\le 4$. Those $T_n$ that admit straight-line embeddings in the plane without obtuse triangles are also characterized.
論文
http://purl.org/coar/resource_type/c_6501
ACADEMIC PRESS INC ELSEVIER SCIENCE
2003-07
AM
http://hdl.handle.net/20.500.12000/568
0095-8956
AA00695859
Journal of Combinatorial Theory Series B
2
88
245
237
eng
http://www.sciencedirect.com/science/journal/00958956
10.1016/S0095-8956(02)00044-8
open access