Genetic algorithm and edge-colorings of complete graphs with connected classes
Combinatorics
2024-12-05 v4
Abstract
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 index. We successfully improved several previously known bounds of that index of the complete graph.
Keywords
Cite
@article{arxiv.2405.01811,
title = {Genetic algorithm and edge-colorings of complete graphs with connected classes},
author = {Jorge Cervantes-Ojeda and María C. Gómez-Fuentes and Christian Rubio-Montiel},
journal= {arXiv preprint arXiv:2405.01811},
year = {2024}
}
Comments
15 pages, 5 figures