On the criteria of D-planarity of a tree

Details On the criteria of D-planarity of a tree On the criteria of D-planarity of a tree

2009-04-08

arxiv.org/abs/0904.1367v2

Mathematics

General Topology

LaTeX, 31 pages, 1 figure, definition of complete cyclic order was corrected

Scientific paper

Let $T$ be a tree with a fixed subset of vertices $V^{\ast}$ such that there is a cyclic order $C$ on it and all terminal vertices are contained in this set. Let $D^{2} = \{(x,y) \in \rr^{2} | x^{2} + y^{2} \leq 1 \}$ be a closed oriented 2--dimensional disk. The tree $T$ is called D-planar if there exists an embedding $\varphi : T \to \rr^{2}$ which satisfies the following conditions $\varphi(T) \subseteq D^{2}$, $\varphi(T) \cap \partial D^{2} = \varphi(V^{\ast})$ and if $\sharp V^{\ast} \geq 3$ then a cyclic order $\varphi(C)$ of $\varphi(V^{\ast})$ coincides with a cyclic order which is generated by the orientation of $\partial D^{2} \cong S^{1}$.

Affiliated with

Also associated with

No associations

Rating

On the criteria of D-planarity of a tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the criteria of D-planarity of a tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the criteria of D-planarity of a tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214772