New bounds on the connected-pseudoachromatic index of complete graphs
Christian Rubio-Montiel (christian.rubio@acatlan.unam.mx)
We improve several previously known bounds of the connected-pseudoachromatic index of complete graphs. We apply a Rank Genetic Algorithm to find experimental solutions above the known lower bounds and then we obtain an approximation of the upper bound to verify and compare to the empirically obtained results.