Without breaking ground on the chromatic phenomena presented by crystals, two other sources of colour may be mentioned here.
"Six Lectures on Light" by John Tyndall
F. If the disc appear blurred and coloured, however the focus be adjusted, incomplete correction for chromatic aberration is inferred.
"On Laboratory Arts" by Richard Threlfall
In these chromatic displays, red is the colour that predominates.
"Chambers's Edinburgh Journal, No. 461" by Various
My room is now done, and looks very gay, and chromatic with its blue walls and my coloured lines of books.
"The Works of Robert Louis Stevenson - Swanston Edition Vol. 25 (of 25)" by Robert Louis Stevenson
It is customary to show the complementary colours diagrammatically by what is known as the chromatic circle.
"Colour Measurement and Mixture" by W. de W. Abney
Form can exist independently of colour, but it never has had any important development without the chromatic adjunct.
"Principles of Decorative Design" by Christopher Dresser
The baskets are coloured yellow with CHROMATE OF LEAD.
"Curiosities of Civilization" by Andrew Wynter
***
Now each such leaf, having colour α′ = vn , can be considered as the root of a new ﬁnite subtree composed only by paths of the type V(n(α′ )), where n(α′ ) is the chromatic matrix obtained from n(α) by changing the root colour from α into α′ .
Random walks in random environment on trees and multiplicative chaos
The chromatic number χ(G) (choice number ch(G) ) of G is the least integer k such that G is k-colourable (k-choosable).
Colouring complete bipartite graphs from random lists
This procedure gives a colouring F of the Boolean lattice of a graph, ﬁrst deﬁned by Helme-Guizon a nd Rong (see ), and the homology of the associated cube complex is related to the chromatic polynomial of Γ .
Homology of coloured posets: a generalisation of Khovanov's cube construction
The chromatic number χ(H ) is the smallest number of colours in a proper colouring of H .
Randomly colouring simple hypergraphs
From a graph theory perspective, this was traditionally motivated by graph colouring questions, since the chromatic polynomial of a graph G, when evaluated at a non-negative integer q , gives the number of ways to properly colour G using q colours.
The Tutte-Potts connection in the presence of an external magnetic field
We study here the chromaticity of W RAGSi (W (v0 )), but again it would be interesting using induction to ﬁnd the chromatic polynomial of a generic W RAGSi (W (v0 )), knowing that for a generic wheel graph the chromatic polynomial is PWn (x) = x((x − 2)(n−1) − (−1)n (x − 2)) if x is the number of possible colours.
Wheel Random Apollonian Graphs
As for graphs, the chromatic index of a design is the smallest number of colours needed for a block colouring.
Generalized packing designs
Furthermore, the enumeration of colour types by Colbourn, Horsley and Wang shows that the chromatic index is in fact 7.
Generalized packing designs
The total chromatic number of a graph G is denoted χ(cid:48)(cid:48) (G) and is deﬁned as the minimum number of colours required to colour E (G) ∪ V (G) such that adjacent vertices and edges have different colours and no vertex has the same colour as its incident edges.
Generation and Properties of Snarks
Among the colourable cyclically 4-edge-connected graphs there are examples that have total chromatic number 5.
Generation and Properties of Snarks
The chromatic number χ(H ) is the smallest k such that there exists a k-colouring of H . A balanced k-colouring of a H is a balanced k-partition which is also a k-colouring of H .
On the chromatic number of a random hypergraph
The strong chromatic number is deﬁned similarly in terms of strong colourings, which are kpartitions σ such that |σ(e)| = |e| for each edge e ∈ E .
On the chromatic number of a random hypergraph
All microlensing groups use a sequence of straight line cuts to identify events (for example, excising chromatic lightcurves or troublesome regions of the colour-magnitude diagran).
RIP: The Macho Era (1974-2004)
As the chromatic polynomial is a particular case of the Tutte polynomial, since the proof of the four colour theorem for planar graph [2, 3], a large number of conjectures have been proposed on the real, integer and complex zeros of the chromatic polynomial for different class of graphs, see .
On the number of clusters for planar graphs
Richard Roth used something slightly co arser than his taxonomy to study perfect and chromatic colouring of fabrics because he did not need its re ﬁnement for that purpose.
Isonemal prefabrics with only parallel axes of symmetry
***