4 citations · 7 across the 7 of their papers we have counts for
8 papers
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…
On the number of heterochromatic trees in nice and beautiful colourings of complete graphs
Juan José Montellano-Ballesteros, Eduardo Rivera-Campo, Ricardo Strausz
We introduce classes of edge-colourings of the complete graph -- that we call nice and beautiful -- and study how many heterochromatic spanning trees appear under such colourings.…
The digrundy number of digraphs
Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen +1
We extend the Grundy number and the ochromatic number, parameters on graph colorings, to digraph colorings, we call them {\emph{digrundy number}} and {\emph{diochromatic number}},…
Conditions on the regularity of balanced -partite tournaments for the existence of strong subtournaments with high minimum degree
Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Mika Olsen
We consider the following problem posed by Volkmann in 2007: How close to regular must a c-partite tournament be, to secure a strongly connected subtournament of order ? We give…
Achromatic number, achromatic index and diachromatic number of circulant graphs and digraphs
Gabriela Araujo-Pardo, Juan Jos{\' e} Montellano-Ballesteros, Mika Olsen +1
In this paper, we determine the achromatic and diachromatic numbers of some circulant graphs and digraphs each one with two lengths and give bounds for other circulant graphs and d…
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 $(…
Decomposition of balanced multipartite tournaments into strongly connected tournaments
A. P. Figueroa, J. J. Montellano-Ballesteros, M. Olsen
Decomposing a digraph into subdigraphs with a fixed structure or property is a classical problem in graph theory and a useful tool in a number of applications of networks and commu…
A Note on the Rainbow Connectivity of Tournaments
Jesús Alva-Samos, Juan José Montellano-Ballesteros
An arc-coloured digraph is said to be \emph{rainbow connected} if for every two vertices and there is an -path all whose arcs have different colours. The minimun nu…