colorable case
Look at other dictionaries:
colorable cause — A case which upon the facts stated in a complaint or accusation is sufficient to invoke thejurisdrction of an inferior court to issue process. Broom v Douglass, 175 Ala 268, 57 So 860 … Ballentine's law dictionary
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Four color theorem — Example of a four colored map A four colori … Wikipedia
Philippine 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… … Wikipedia
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
Register 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… … Wikipedia
Frivolous litigation — Tort law Part of the … Wikipedia
Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? … Wikipedia
De Bruijn–Erdős theorem (graph theory) — This article is about coloring infinite graphs. For the number of lines determined by a finite set of points, see De Bruijn–Erdős theorem (incidence geometry). In graph theory, the De Bruijn–Erdős theorem, proved by Nicolaas Govert de Bruijn and… … Wikipedia
Dilworth's theorem — In mathematics, in the areas of order theory and combinatorics, Dilworth s theorem characterizes the width of any finite partially ordered set in terms of a partition of the order into a minimum number of chains. It is named for the mathematician … Wikipedia
