Chromatic roots are dense in the whole complex plane [PDF]
I show that the zeros of the chromatic polynomials P-G(q) for the generalized theta graphs Theta((s.p)) are taken together, dense in the whole complex plane with the possible exception of the disc \q - l\ < l.
Sokal, AD
core
Critical chromatic number and the complexity of perfect packings in graphs [PDF]
Daniela Kühn, Deryk Osthus
openaire +2 more sources
THE PACKING CHROMATIC NUMBER OF HARARY GRAPHS
openaire +1 more source
An empirical three-dimensional metric field for color space. [PDF]
Koenderink JJ +3 more
europepmc +1 more source
Structure-function relationships in a square-planar Cu(ii) hybrid halometalate: experimental, DFT, molecular docking, optical, and biological studies. [PDF]
Khlifi H +9 more
europepmc +1 more source
Packing chromatic number of the join of some classes of graphs
Alje Marie M. Urenda +4 more
openaire +1 more source
Evaluation of the Alterability of Natural and Artificial Agglomerated Stones Produced in Epoxy Matrix. [PDF]
Castilho EDF +6 more
europepmc +1 more source
PACKING CHROMATIC NUMBER OF CERTAIN DENDRIMERS [PDF]
openaire +1 more source
End-to-End Image Demosaicking via Region-Level Non-Local Modeling and Residual Aggregation. [PDF]
Wei L, Liu H.
europepmc +1 more source
ON THE PACKING CHROMATIC NUMBER ON HAMMING GRAPHS AND GENERAL GRAPHS
The packing chromatic number χρ(G) of a graph G is the smallest integer k needed to proper color the vertices of G in such a way the distance between any two vertices having color i be at least i + 1.
Daniel Severin +2 more
core

