花容

Their scent and their appearance have inspired us since the very beginning.

第一眼相见，它们的花香、花容就让我们为之惊叹。

We want to tell them the beauty face but they refuse to believe it.

我们想告诉他们，花容总有凋谢旳&天，但他们拒绝相信。

She succeeded because of her superb acting skills as well as her exceptional beauty.

阮玲玉之所以能走红，主要是由于她的精湛演技和花容月貌。

There they were as our guests, accepted and accepting.

露出了花容美姿已被人窥见的神色。它们在那儿仿佛是我们的客人，受到我们的接待也在接待我们。

Shou tomb, but could not restrain your flower face.

守墓，却守不住你如花容颜。

As the old saying goes: “ Flowers are pleasant to look at but hard to grow ”, it is much difficult to grow camellias.

正如俗话所说“看花容易栽花难”，栽培茶花是很不容易的。

His words immediately made the fair lady turn pale.

他的一番话顿时令小姐花容失色。

Hurry thought more of the beauties of Judith Hutter.

赫里念念不忘朱迪思·哈特的花容月貌.

As the old saying goes : " Flowers are pleasant to look at but hard to grow ", it is much difficult to grow camellias.

正如俗话所说 “ 看花容易栽花难 ”, 栽培茶花是很不容易的.

Twelve years had changed Anne from the blooming, silent, unformed girl of fifteen, to the elegant little woman of seven and twenty.

十二年来，安妮已经从一个花容月貌、沉默寡言、尚未定型的十五岁的小姑娘，变成了一个仪容典雅的二十七岁的年轻妇女。

So when fashion magazine Grazia earlier this year revealed that the secret to Aniston's ageless beauty is a "wonder smoothie," the drink became all the rage.

所以，今年年初当时尚杂志《红秀》透露珍妮弗•安妮斯顿花容不衰的秘方就是神奇果蔬汁后，这种饮品风靡一时。

Do you want to meet a beautiful secretary in my office?

你要不要见见我办公室里的一位花容玉貌的秘书？

I was thrilled by her beauty.

她花容月貌教我一见倾心.

Her features did not seem to know the value of teamwork.

她的花容,似乎不知(五官)集体配合之价值为何物.

For the best display and neatest look, they should be pruned back hard each spring to about two feet off the ground.

为了最好成绩的观赏效果和整洁的花容，每年春天都要修剪它们，留下根部以上两英尺内的就好。

So, when people finally started focusing on lilies and roses in her comics, she was hesitant.

所以, 当人们开始关注她漫画中的花容月貌时, 她犹豫了.

Her feature does not seem to know the value of teamwork.

她的花容，似乎不知（五官）集体配合之价值为何物。

So, when people finally started focusing on the lilies and roses in her comics, she was hesitant.

所以，当人们开始关注她漫画中的花容月貌时，她犹豫了。

In this paper the capacity of tree-flower in Edmonds theorem of graph theory is extended to minimum covering points and a computing formula of minimum covering points for non-dual graph is introduced.

文中把图论里Edmonds定理的树花容量扩展为最小复盖点，并得到了计算非偶图最小复盖点数的公式。