activity
20172023
most citedHow to construct the symmetric cycle of length 5 using Hajós construction with an adapted Rank Genetic Algorithm

3 citations · 8 across the 9 of their papers we have counts for

collaborators
Showing 2017Show all

2 papers · 1 filter

math.CO2017

The diachromatic number of digraphs

Gabriela Araujo-Pardo, Juan José Montellano-Ballesteros, Mika Olsen +1

We consider the extension to directed graphs of the concept of achromatic number in terms of acyclic vertex colorings. The achromatic number have been intensely studied since it wa…

math.CO2017★ 2 cited

Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments

H. Galeana-Sánchez, M. Olsen

A digraph such that every proper induced subdigraph has a kernel is said to be \emph{kernel perfect} (KP for short) (\emph{critical kernel imperfect} (CKI for short) resp.) if the…