- colorability
-
окрашиваемость, накрашиваемость (волокна)
Англо-русский словарь технических терминов. 2005.
colorability
Смотреть что такое "colorability" в других словарях:
colorability — See colorable. * * * … Universalium
colorability — noun a) The state or condition of being colorable. b) The ability of a colorless photochromic material to develop color … Wiktionary
colorability — n. ability to be colored or painted … English contemporary dictionary
colorability — col·or·a·bil·i·ty … English syllables
colorability — ˌkəl(ə)rəˈbiləd.ē, ətē, i noun ( es) : the quality of being colorable … Useful english dictionary
colorable — colorability, colorableness, n. colorably, adv. /kul euhr euh beuhl/, adj. 1. capable of being colored. 2. seemingly valid, true, or genuine; plausible. 3. pretended; deceptive. [1400 50; late ME; see COLOR, ABLE] * * * … Universalium
Graph coloring — A proper vertex coloring of the Petersen graph with 3 colors, the minimum number possible. In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called colors to elements of a graph… … Wikipedia
Doctrine of colourability — The doctrine of colourability is the idea that when the legislature wants to do something that it cannot do within the constraints of the constitution, it colours the law with a substitute purpose which will still allow it to accomplish its… … Wikipedia
Hadwiger conjecture (graph theory) — In graph theory, the Hadwiger conjecture (or Hadwiger s conjecture) states that, if an undirected graph G requires k or more colors in any vertex coloring, then one can find k disjoint connected subgraphs of G such that each subgraph is connected … Wikipedia
Mathematics of paper folding — The art of origami or paper folding has received a considerable amount of mathematical study. Fields of interest include a given paper model s flat foldability (whether the model can be flattened without damaging it) and the use of paper folds to … Wikipedia
List coloring — In graph theory, a branch of mathematics, list coloring is a type of graph coloring where each vertex can be restricted to a list of allowed colors, first studied by Vizing [1] and by Erdős, Rubin, and Taylor.[2][3][4] … Wikipedia
