Results 51 to 60 of about 9,106,907 (129)

Chromatic roots are dense in the whole complex plane [PDF]

open access: yes, 2004
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]

open access: yesProceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06, 2006
Daniela Kühn, Deryk Osthus
openaire   +2 more sources

THE PACKING CHROMATIC NUMBER OF HARARY GRAPHS

open access: yesInternational Journal of Engineering Sciences & Research Technology, 2021
openaire   +1 more source

An empirical three-dimensional metric field for color space. [PDF]

open access: yesJ Vis
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]

open access: yesRSC Adv
Khlifi H   +9 more
europepmc   +1 more source

Packing chromatic number of the join of some classes of graphs

open access: yesInternational Mathematical Forum, 2022
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]

open access: yesPolymers (Basel)
Castilho EDF   +6 more
europepmc   +1 more source

PACKING CHROMATIC NUMBER OF CERTAIN DENDRIMERS [PDF]

open access: yesInternational Journal of Pure and Apllied Mathematics, 2017
openaire   +1 more source

ON THE PACKING CHROMATIC NUMBER ON HAMMING GRAPHS AND GENERAL GRAPHS

open access: yes, 2016
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  

Home - About - Disclaimer - Privacy