4 papers
On the dib-chromatic number of a digraph
Juan José Montellano-Ballesteros, Christian Rubio-Montiel
An acyclic coloring of a digraph that maximizes the number of colors such that each color class has a vertex pointing to all other classes and a vertex pointing to it from all othe…
The dib-chromatic number of digraphs
Nahid Javier-Nol, Christian Rubio-Montiel, Ingrid Torres-Ramos
We study an extension to directed graphs of the parameter called the -chromatic number of a graph in terms of acyclic vertex colorings: the dib-chromatic number. We give general…
Genetic algorithm and edge-colorings of complete graphs with connected classes
Jorge Cervantes-Ojeda, María C. Gómez-Fuentes, Christian Rubio-Montiel
In this study, the Rank Genetic Algorithm was adapted to address a problem in the field of Chromatic Graph Theory, namely, on the parameter called the connected-pseudoachromatic in…
Banff designs: difference methods for coloring incidence graphs
Marco Buratti, Francesca Merola, Anamari Nakic +1
We present some results on the harmonious colorings of the Levi graph of a -design, focusing on Steiner -designs. It is easily seen that the harmonious chromatic number of su…