choosable

choosable的基本解释

-

可选择的

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

Therefore, we have to consider a weak problem, that is, toclassify the (2,3)-choosable complete bipartite graphs.

事实上，这是一项困难的工怍即使是对3一可选的完全二部图，也是如此。

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 addition, we prove that every planar graph without 4-circuits and intersecting triangles is (3, l)*-choosable.

此外，论文还证明了每个无4-圈和相交三角形的平面图是(3，1)~*-可选色的。

Used the way of discharging to prove that every planar graph without 4-cycles and i-cycles for some i ∈{5,6,7} is (3, l)*-choosable, when they studied the list improper colorings of plane graphs.

72在研究平面图的列表非正常染色时，结合欧拉公式用放电的方法证明了每个不含4-圈和i-圈的平面图是(3，1)~*-可选的，其中i∈{5，6，7}。

Header or footer can be specified with choosable font and size and with optional page number.

页眉或页脚，可以指定可选的字体和大小和可选的页码。