Plane graphs with straight edges whose bounded faces are acute triangles
スポンサーリンク
概要
- 論文の詳細を見る
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.
- ACADEMIC PRESS INC ELSEVIER SCIENCEの論文
- 2003-07-00
ACADEMIC PRESS INC ELSEVIER SCIENCE | 論文
- Anti-ice nucleation activity in xylem extracts from trees that contain deep supercooling xylem parenchyma cells
- Glucose-sulfate conjugates as a new phase II metabolite formed by aquatic crustaceans
- Changes in S1P(1) and SIP(2) expression during embryonal development and primitive endoderm differentiation of F9 cells
- Peroxisome proliferator-activated receptor α-independent peroxisome proliferation
- Molecular characteristics of IgA and IgM Fc binding to the Fc alpha/mu R