colorable
91Scheinerman's conjecture — In mathematics, Scheinerman s conjecture states that every planar graph is the intersection graph of a set of line segments in the plane. This conjecture was formulated by E. R. Scheinerman in his Ph.D. thesis (1984), following earlier results… …
92Complexity of constraint satisfaction — The complexity of constraint satisfaction is the application of computational complexity theory on constraint satisfaction. It has mainly been studied for discriminating between tractable and intractable classes of constraint satisfaction… …
93Fox n-coloring — In the mathematical field of knot theory, Fox n coloring is a method of specifying a representation of a knot group (or a link group) onto the dihedral group of order n where n is an odd integer by coloring arcs in a link diagram (the… …
94Gudalur Janmam Abolition Act — The Gudalur Janmam Estates Act (Abolition and Conversion into Ryotwari) of 1969 was specially created for the Gudalur Taluk of Nilgiris District in Tamil Nadu State in India. The Act passed by the Tamilnadu State Legislature as Act 24/1969. The… …
95Tricolorability — The tricolorability of a knot refers to the ability of a knot to be colored with three colors according to two rules. In the mathematical field of knot theory, tricolorability is an isotopy invariant, and hence can be used to distinguish between… …
96Grötzsch graph — infobox graph name = Grötzsch graph namesake = Herbert Grötzsch vertices = 11 edges = 20 chromatic number = 4 chromatic index = girth = 4 properties = The Grötzsch graph is a triangle free graph with 11 vertices, 20 edges, and chromatic number 4 …
97Hedetniemi's conjecture — In graph theory, Hedetniemi s conjecture concerns the connection between graph coloring and the tensor product of graphs. This conjecture states that:χ( G × H ) = min {χ( G ), χ( H )}.Here χ( G ) denotes the chromatic number of an undirected… …
98Strickland v. Washington — SCOTUSCase Litigants=Strickland v. Washington ArgueDate=January 10 ArgueYear=1984 DecideDate=May 14 DecideYear=1984 FullName=Strickland, Superintendent, Florida State Prison, v. Washington USVol=466 USPage=668 Citation=466 U.S. 668; 104 S. Ct.… …
99Nowhere-zero flow — In graph theory, nowhere zero flows are a special type of network flow which is related (by duality) to coloring planar graphs. Let G = (V,E) be a directed graph and let M be an abelian group. We say that a map is a flow or an M flow if the… …
100Merrell Dow Pharmaceuticals Inc. v. Thompson — Supreme Court of the United States Argued April 28, 1986 …
