colorable
41Graph 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… …
42Philippine Trademark Law — R.A. 8293, otherwise known as the Intellectual Property Code, defines a trademark as “any visible sign capable of distinguishing goods.” Early jurisprudence has taken it to mean “a sign, device or mark by which the articles produced or dealt in… …
43colorer — [ kɔlɔre ] v. tr. <conjug. : 1> • 1160; dér. anc. de couleur, refait sur lat. colorare 1 ♦ Revêtir de couleur; donner une certaine teinte à (qqch.). ⇒ teindre, teinter (bleuir, jaunir, rougir, verdir, etc.). Le soleil colore le couchant.… …
44plausible — plausible, credible, believable, colorable, specious are comparable when they mean capable of impressing the observer, auditor, or reader as truly or genuinely possessing the quality or character that is set forth or claimed. A thing or sometimes …
45Cycle graph — This article is about connected, 2 regular graphs. For other uses, see Cycle graph (disambiguation). Cycle graph A cycle graph of length 6 Vertices n …
46Triangle-free graph — In the mathematical area of graph theory, a triangle free graph is an undirected graph in which no three vertices form a triangle of edges. Triangle free graphs may be equivalently defined as graphs with clique number ≤ 2, graphs with girth ≥ 4,… …
47Register allocation — In compiler optimization, register allocation is the process of multiplexing a large number of target program variables onto a small number of CPU registers. The goal is to keep as many operands as possible in registers to maximise the execution… …
48List 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] …
49Strong coloring — [ This cubic graph is strongly 4 colorable. The 4 sized partitions are 35, but only this 7 partitions are topologically unique.] In graph theory, a strong coloring, with respect to a partition of the vertices into (disjoint) subsets of equal… …
50Kenneth Appel — Kenneth Appel, auch Ken Appel (* 8. Oktober 1932 in Brooklyn, New York City) ist ein US amerikanischer Mathematiker, der vor allem wegen seines Beweises des Vierfarbensatzes mit Wolfgang Haken 1976 bekannt ist. Appel studierte bis 1953 am Queens… …
