I read for the lustres, as if one should use a fine picture in a chromatic experiment, for its rich colors.
"Essays, Second Series" by Ralph Waldo Emerson
Within a small segment of the chromatic bow Chopin has imprisoned new, strangely dissonant colors.
"Chopin: The Man and His Music" by James Huneker
The remainder of the lecture was devoted to an explanation of the determination of the chromatic relations of the colors of the spectrum.
"Scientific American Supplement, No. 598, June 18, 1887" by Various
The Meissonier lad's collection of rabbits' ears increased until he had nearly colors enough to run the chromatic scale.
"Little Journeys to the Homes of the Great, Volume 4 (of 14)" by Elbert Hubbard
These five middle colors form a Chromatic Tuning Fork.
"A Color Notation" by Albert H. Munsell
STUDENTS' TEXT-BOOK OF COLOR; Or, Modern Chromatics.
"A History of the Growth of the Steam-Engine" by Robert H. Thurston
Then we are experimenting in colors for a new fairy-book; and our chromatic Bibles will be a great thing.
"Peeps at People" by John Kendrick Bangs
***
Chromaticity , an integrator of color-management hardware and software for digital workflows, is offering a three-day hands-on workshop Sept 17-19 at their headquarters in Grand Rapids, MI.
The cal -COLOR 400 Colormeter provides fast and accurate measurements of color temperature, absolute chromaticity values and illuminance of light sources, and display areas.
The cal-COLOR 400 Colormeter provides fast and accurate measurements of color temperature, absolute chromaticity values and illuminance of light sources, and display areas.
Designed especially for its limited-edition, 16-ounce cans in honor of "The Dark Knight Rises," Mountain Dew partnered with Chromatic Technologies Inc (CTI) to add a color-changing element to the can's design.
Chromatic Technology Inc created a color-changing ink that is temperature-activated.
The company says CineVista overcomes the color fringing effect (lateral chromatic aberration) that can be found on some low-cost anamorphic lenses .
The Zinc-Chro-SHIELD™ Yellow sealer is specially formulated to maintain the bright yellow color of yellow hexavalent chromated zinc deposits, while enhancing corrosion protection.
***
The chromatic number of G, χ(G), is the minimal cardinality of a ﬁnite set S , such that there exists a vertex-coloring c : V (G) → S .
Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
For a hypergraph H, the chromatic number χ(H) is, by deﬁnition, the minimal number of colors needed to color the vertices of H so that no hyperedge is monochromatic.
Chromatic numbers, morphism complexes, and Stiefel-Whitney characteristic classes
The minimum number of colors necessary for such a coloring of G is called the chromatic number, χ(G).
Transfer Matrices for the Partition Function of the Potts Model on Toroidal Lattice Strips
For the chromatic polynomials, it is necessary that adjacent vertices are not assigned the same color, i.e., in the partition diagrams, adjacent vertices cannot be connected by colorconnection lines.
Transfer Matrices for the Partition Function of the Potts Model on Toroidal Lattice Strips
The total chromatic number of G, denoted χ′′ (G), is the least integer k such that G is k-total-colorable.
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
The list edge chromatic number χ′ l (G) is deﬁned similarly in terms of coloring only edges; the ordinary edge chromatic number is denoted χ′ (G).
Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles
Moreover, Theorem 4.1 shows that every 2-edge-coloring of KN with N ≥ 24dq n contains at least 2−4dqnN n labeled monochromatic copies of any n-vertex graph H with chromatic number q and maximum degree d.
Density theorems for bipartite graphs and related Ramsey-type results
This implies that the Ramsey multiplicity for graphs with ﬁxed chromatic number and whose average degree is at least a constant fraction of the maximum degree is not very far from the bound given by a random coloring.
Density theorems for bipartite graphs and related Ramsey-type results
The degenerate chromatic number of G, denoted as χd (G), is the least n such that G admits a degenerate n-coloring.
Degenerate and star colorings of graphs on surfaces
The least n such that G admits a star coloring with n colors is called the star chromatic number of G, denoted as χs(G).
Degenerate and star colorings of graphs on surfaces
In Fig. 1 we give an example of a graph whose star chromatic number is four, but has no degenerate four-coloring (since its minimum degree is four).
Degenerate and star colorings of graphs on surfaces
The chromatic number of H is the smallest number of colors for which there exists a proper coloring of H .
Coloring half-planes and bottomless rectangles
The study of the chromatic number of such hypergraphs was stimulated by conﬂict-free colorings ().
Coloring half-planes and bottomless rectangles
Similar statements can be proved for forbidden induced subgraphs, where the role of the chromatic number is played by the coloring number χc of a graph property, introduced ﬁrst in , and deﬁned below.
Some new results in extremal graph theory
If we can recolor the vertices of T with fewer than 5 colors, we get a contradiction with the chromatic number of G.
Large cliques in graphs with high chromatic number
***