On the criteria of D-planarity of a tree
Abstract
Let T be a tree with a fixed subset of vertices V such that there is a cyclic order C on it and all terminal vertices are contained in this set. Let D2 = \(x,y) ∈ 2 | x2 + y2 ≤ 1 \ be a closed oriented 2--dimensional disk. The tree T is called D-planar if there exists an embedding : T 2 which satisfies the following conditions (T) ⊂eq D2, (T) ∂ D2 = (V) and if V ≥ 3 then a cyclic order (C) of (V) coincides with a cyclic order which is generated by the orientation of ∂ D2 S1.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.