2 citations · 3 across the 7 of their papers we have counts for
23 papers
On Grundy indices for complete geometric graphs
Dolores Lara, Christian Rubio-Montiel, Francisco Zaragoza
The pseudo-Grundy index of a graph is the largest number of colors that can be assigned to its edges, such that for every pair of colors , if then every edge colored w…
Acyclic and complete coloring of digraphs with the minimum and maximum possible numbers of colors
Mika Olsen, Christian Rubio-Montiel, Alejandra Silva Ramirez
The dichromatic and diachromatic numbers of a digraph are the minimum and maximum numbers of colors, respectively, in acyclic and complete colorings of the digraph. In this paper,…
A sharp upper bound for the harmonious total chromatic number of graphs and multigraphs
M. Abreu, J. B. Gauci, D. Mattiolo +4
A proper total colouring of a graph is called harmonious if it has the further property that when replacing each unordered pair of incident vertices and edges with their colour…
On the harmonious chromatic number of graphs
Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen +1
The harmonious chromatic number of a graph is the minimum number of colors that can be assigned to the vertices of in a proper way such that any two distinct edges have dif…
Zykov sums of digraphs with diachromatic number equal to their harmonious number
Mika Olsen, Christian Rubio-Montiel, Alejandra Silva-Ramírez
The dichromatic number and the diachromatic number are generalizations of the chromatic number and the achromatic number for digraphs considering acyclic colorings. In this paper,…
Achromatic arboricity on complete graphs
Gabriela Araujo-Pardo, Christian Rubio-Montiel
In this paper we study the {\it {achromatic arboricity}} of the complete graph. This parameter arises from the arboricity of a graph as the achromatic index arises from the chromat…