5 papers
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…
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…
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…