3 Good Subtree-Representations

The main result of this paper is a linear time algorithm that, given an SC 3-tree (i.e. a maximal planar chordal graph), determines in linear time whether it contains an LCST or

On the other hand, Lemma 3.2 can be viewed to be some sort of extension of the theorem asserting the existence of continuous partitions of unity.. The existence of continuous

locally homogenous complex manifolds are the moduli spaces for that class of varieties... Returning to the situation in which 0393BD is a moduli space, in general 0393BD

The set 7 consists of the boundary of the unit square and of vertical lines, one for each dyadic rational point on the base interval ofour square.. These

First introduced by Faddeev and Kashaev [7, 9], the quantum dilogarithm G b (x) and its variants S b (x) and g b (x) play a crucial role in the study of positive representations

For example, he proved independently that two completely regular spaces X and Y have homeomorphic realcompactifications νX and νY whenever there is a biseparating linear maps from

The following theorem is the main result of this section, which tells us the sharp upper bound of the number of subtrees of a caterpillar and when the upper bound can be

For general n ≥ 2, G n was first studied by Chai, Wang and the second author [4] from the viewpoint of algebraic geometry. Among other things, they established the