2 papers
math.CO2019
On the packing chromatic number of Moore graphs
Julián Fresán-Figueroa, Diego González-Moreno, Mika Olsen
The \emph{packing chromatic number } of a graph is the smallest integer for which there exists a vertex coloring such that an…
math.CO2019
Vertex-monochromatic connectivity of strong digraphs
Diego González-Moreno, Mucuy-kak Guevara, Juan José Montellano-Ballesteros
A vertex coloring of a strong digraph is a \emph{strong vertex-monochromatic connection coloring (SVMC-coloring)} if for every pair of vertices in there exists an $(…