Buscar
Mostrando ítems 1-4 de 4
On the packing chromatic number of hypercubes
(Elsevier Science, 2013-11)
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 that the distance in G between any two vertices having color i be at least i + 1. Goddard et ...
The packing chromatic number of hypercubes
(Elsevier Science, 2015-08)
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 that the distance in G between any two vertices having color i be at leasti+1. Goddard et ...
The packing coloring problem for lobsters and partner limited graphs
(Elsevier Science, 2014-08)
A packing k-coloring of a graph G is a k-coloring such that the distance between two vertices having color i is at least i + 1. To compute the packing chromatic number is NP-hard, even restricted to trees, and it is known ...
Evaluación del proceso de cristalización inducida en miel de plantaciones forestales de Acacia mangium
(Universidad Nacional de ColombiaBogotá - Ciencias Agrarias - Maestría en Ciencia y Tecnología de AlimentosFacultad de Ciencias AgrariasBogotá, ColombiaUniversidad Nacional de Colombia - Sede Bogotá, 2023-05-29)
La miel sufre un proceso de cristalización natural al ser una solución sobresaturada en glucosa. La velocidad de este proceso depende esencialmente de su composición química, aunque los procesos tecnológicos (tratamientos ...