Results 181 to 190 of about 2,245 (216)
Some of the next articles are maybe not open access.
Chromatic Scheduling and the Chromatic Number Problem
Management Science, 1972The chromatic scheduling problem may be defined as any problem in which the solution is a partition of a set of objects. Since the partitions may not be distinct, redundant solutions can be generated when partial enumeration techniques are applied to chromatic scheduling problems. The necessary theory is developed to prevent redundant solutions in the
openaire +1 more source
The Quarterly Journal of Mathematics, 1987
A chromatic geometry, or rainbow, is defined as follows. Let X and I be sets and \(\Delta\) : \(X\times X\to I\) a surjective function. For \(i\in I\) we write \(\Delta_ i\) for the inverse image in \(X\times X\) of i under \(\Delta\) and define \(\Delta \quad p_ i=\{(y,x): (x,y)\in \Delta_ i\}.\) A triple (X,\(\Delta\),I) is a chromatic geometry or ...
openaire +2 more sources
A chromatic geometry, or rainbow, is defined as follows. Let X and I be sets and \(\Delta\) : \(X\times X\to I\) a surjective function. For \(i\in I\) we write \(\Delta_ i\) for the inverse image in \(X\times X\) of i under \(\Delta\) and define \(\Delta \quad p_ i=\{(y,x): (x,y)\in \Delta_ i\}.\) A triple (X,\(\Delta\),I) is a chromatic geometry or ...
openaire +2 more sources
Dependence of the chromatic valence function on chromatic standards
Vision Research, 1989The red, green, yellow, and blue curve portions of chromatic valence functions (CVFs) were measured by an iso-cancellation technique using three or four different chromatic standards (cancellation stimuli of fixed intensity and chromaticity) for each of the four curve portions.
M, Ayama, M, Ikeda
openaire +2 more sources
The adaptable chromatic number and the chromatic number
J. Graph Theory, 2017Consider a graph \(G\) whose edges are colored (perhaps not properly) using the colors \(1, \ldots, k\). A \(k\)-adapted coloring of \(G\), relative to the given edge coloring, is an assignment of the colors \(1, \ldots, k\) to the vertices of \(G\) (not necessarily a proper coloring) such that no edge shares its color with both of its endpoints. Thus,
openaire +2 more sources
Archives of Ophthalmology, 1979
To the Editor. —There is an important error in the article "Colorimetry by a New Principle" by Gunkel and Cogan (Archives96:331-334, 1978) that should not pass uncorrected. Under the heading "A practical chromaticity system," the authors attribute the discovery of the chromaticity circle to Sir Isaac Newton.
openaire +2 more sources
To the Editor. —There is an important error in the article "Colorimetry by a New Principle" by Gunkel and Cogan (Archives96:331-334, 1978) that should not pass uncorrected. Under the heading "A practical chromaticity system," the authors attribute the discovery of the chromaticity circle to Sir Isaac Newton.
openaire +2 more sources
Chromate Allergy: Chromate Content of Asian Cement
The Journal of Dermatology, 1986AbstractThe chromate content of 10 different Asian cements is studied. The hexavalent chromate and total chromium concentrations in these cements were analyzed using colorimetric spectrophometry and flame atomic absorption spectrophotometry, respectively. The pH of an aliquot of 20% w/v of cement in water ranged from 11.8 to 12.1.
C L, Goh, S F, Kwok
openaire +2 more sources
Canadian Journal of Mathematics, 1982
Early in the Seventies I sought the number of rooted λ-coloured triangulations of the sphere with 2p faces. In these triangulations double joins, but not loops, were permitted. The investigation soon took the form of a discussion of a certain formal power series l(y, z, λ) in two independent variables y and z.The basic theory of l is set out in [1 ...
openaire +1 more source
Early in the Seventies I sought the number of rooted λ-coloured triangulations of the sphere with 2p faces. In these triangulations double joins, but not loops, were permitted. The investigation soon took the form of a discussion of a certain formal power series l(y, z, λ) in two independent variables y and z.The basic theory of l is set out in [1 ...
openaire +1 more source
Purely chromatic and hyper chromatic lattices
Asian-European Journal of Mathematics, 2019We introduce the concepts of a hyper chromatic, a critically chromatic and a purely chromatic lattice. We obtain some characterizations for purely chromatic and hyper chromatic dismantlable lattices. We prove relationships between the chromatic number of two lattices and their linear sum, vertical sum and adjunct.
Madhukar M. Pawar, Amit S. Wadile
openaire +2 more sources
Chromaticity of Chordal Graphs
Graphs and Combinatorics, 1997A chordal graph is a graph that does not contain any induced cycle with length greater than 3. A polynomial \(P=\lambda^{m_0}(\lambda-1)^{m_1}\cdots (\lambda-k)^{m_k}\) is said to be a chordal polynomial, if for any graph \(G\), \(P(G,\lambda)=P\) implies \(G\) is a chordal graph. The main result of this paper is the following: If \(m_0=1\) and \(\sum_{
openaire +3 more sources
Chromate ingestion in chronic chromate dermatitis
Contact Dermatitis, 1978K, Kaaber, N K, Veien
openaire +2 more sources