choosable

choosable的基本解释

-

可选择的

与choosable相关的网络例句 [注：此内容来源于网络，仅供参考]

If G is acyclically L-list colorable for any list assignment with |L|≥κfor all v∈V,then G is acyclicallyκ-choosable.The acyclic list chromatic number,denoted byχ_a~l,of a graph G is the smallest integerκsuch that G is acyclicallyκ-choosable.

若对满足|L|≥κ，v∈V的色列表L，G都是无圈L-可染的，那么称G是无圈κ-可选择的。G的无圈列表色数χ_a~l是使得G是无圈κ-可选择的最小的非负整数κ。

In Chapter 3,we obtain that:(1)each planar graph without 4-cycles is acyclically 6-choosable;(2)each planar graph without 4-cycles and without triangles at dis-tance less than 3 is acyclically 5-choosable.

在第三章中，我们获得了以下两个结果：(1)每个不包含4-圈的平面图是无圈6-可选择的；(2)每个不包含4-圈并且任意两个三角形之间的距离至少是3的平面图是无圈5-可选择的。

Thus the (2,3)-choosable completebipartite graphs are completely characterized here, which, we consider, will beIIuseful in the further research of the 3-choosable bipartite graphs.

我们给出了所有的(2，3)一可选的完全二部图，星图、(m+n≤9且当n一4时m≠5)，相信此结果对研究3一可选二部图会有一定帮助。