查询词典 colorable

The total chromatic number, denoted by X, is defined as the minimum number k for which G is k-total colorable.

本文证明了对最大度为6的双外平面图，全色数是+1，其中△为G的最大度数。

If G has a properκ-coloring,then G is said to beκ-colorable.

若图G有一个正常κ-点染色，那么就称图G是κ-点可染色的。

Part of what we wanna to is to have somebody who is colorable and clear , when it comes to this large…firms that could potentially bring down the entire financial system.

奥巴马说政府和美国军方做好了充分准备，应对任何可能发生的意外事件，关于北韩，如对夏威夷可能发射远程导弹。

A graph is said to be equitably -colorable if the vertices of is colored with colors such that there are no two adjacent vertices of the same color and the size of the color classes differ by at most one.

如果图上的点可以用个颜色来著色使得相邻的点著不同的颜色且颜色类的大小差最多是1，我们就说这个图是可均匀著色。

But while the report found that some real estate was 'not reasonably valued' in 2008 it 'did not find sufficient evidence to support a colorable claim for breach of fiduciary duty in connection with any of Lehman's valuations.

但是，虽然报告发现部分房地产贷款在2008年"估值不合理"，但它也"没有找到足够的证据"，来支持"雷曼对估值的做法违背了其信托责任"这一"表面可靠"的论断。

Nor have legitimate grounds ever failed a prince who wish to show colorable excuse for the nonfulfilment of his promise.

当一个王子在未完成其承诺时找出种种借口时，并没有合法的理由处置他。

In the paper, the via minimization problem in multi layer routing with adjacent constraints is translated to a k colorable problem which has more general meanings, and a mean field annealing algorithm for the k colorable problem is proposed.

该文把具有相邻约束的多层通孔最小化问题转换为更具广泛意义的 k-着色问题，并提出了 k-着色问题的均场退火求解算法。

If for every k-list assignment L, there exists a linear edge L-coloring, then G is called linear k-list colorable.

图G的列表线性荫度是使得G是线性边k-列表可着色的最小正整数，记为lla。

Ifσ: I→C is an incidence coloring of G and |C|=k, k is a positive integer, then we say that G is k- incidence colorable andσis a k - incidence coloring of G; The minimum value of k such that G is k -incidence colorable is called the incidence chromatic number of G, and is denoted byχ_i, namelyχ_i = min {|C||σ: I→C is an incidence coloring of G}.

若σ：I(G→C是G的一个关联着色且|C|=k，k是一个正整数，则称G是k-可关联着色的，σ是G的一个k-关联着色；使得G是k-可关联着色的最小的k值称为G的关联色数，记为X_i，即X_i=min{|C||σ：I→C是G的关联着色}。

In Chapter 2,we prove that:(1)each planar graph without {4,6,7,9}-cycles is 3-colorable;(2)each planar graph without {4,6,8}-cycles is 3-colorable.

在第二章中，我们证明了以下两个结果：(1)每个不包含{4，6，7，9}-圈的平面图是3-可染色的；(2)每个不包含{4，6，8}-圈的平面图是3-可染色的。

I am accused of being overreligious," she said in her quiet, frank manner,"but that does not prevent me thinking the children very cruel who obstinately commit such suicide.""

客人们在卡罗利娜·埃凯家里，举止就文雅一些，因为卡罗利娜的母亲治家很严厉。

Designed by French fashion house Herm è s, this elegant uniform was manufactured in our home, Hong Kong, and was the first without a hat.

由著名品牌 Herm è s 设计，这件高贵的制服是香港本土制造，是我们第一套不配帽子的制服。