Coloraciones y conjuntos aciclicos en digraficas - Mika Olsen (2005)

Infinite families of tight regular tournaments. - Bernardo Llano; Mika Olsen (Discuss. Math. Graph Theory, 2007)

Infinite families of (n+1)-dichromatic vertex critical circulant tournaments. - Gabriela Araujo-Pardo; Mika Olsen (Electron. Notes Discret. Math., 2007)

On a Conjecture of Víctor Neumann-Lara. - Bernardo Llano; Mika Olsen (Electron. Notes Discret. Math., 2008)

Enumeration and dichromatic number of tame tournaments. - Victor Neumann-Lara; Mika Olsen (Australas. J Comb., 2009)

On (k, g; l)-dicages. - Gabriela Araujo-Pardo; Camino Balbuena; Mika Olsen (Ars Comb., 2009)

A conjecture of Neumann-Lara on infinite families of r-dichromatic circulant tournaments. - Gabriela Araujo-Pardo; Mika Olsen (Discret. Math., 2010)

Kernels by monochromatic paths in digraphs with covering number 2. - Hortensia Galeana-Sánchez; Mika Olsen (Discret. Math., 2011)

The tight bound on the number of C_3-free vertices on regular 3-partite tournaments. - Ana Paulina Figueroa; Mika Olsen (Australas. J Comb., 2012)

On the acyclic disconnection of multipartite tournaments. - Ana Paulina Figueroa; Bernardo Llano; Mika Olsen; Eduardo Rivera-Campo (Discret. Appl. Math., 2012)

Molds of regular tournaments. - Victor Neumann-Lara; Mika Olsen (Ars Comb., 2013)

Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3. - Hortensia Galeana-Sánchez; Mika Olsen (Discret. Math., 2013)

On the acyclic disconnection and the girth. - Camino Balbuena; Mika Olsen (Discret. Appl. Math., 2015)

On the vertices of a 3-partite tournament not in triangles. - Ana Paulina Figueroa; Mika Olsen; Rita Zuazua (Discret. Math., 2015)

Strong subtournaments and cycles of multipartite tournaments. - Ana Paulina Figueroa; Juan José Montellano-Ballesteros; Mika Olsen (Discret. Math., 2016)

Vertex-disjoint cycles in bipartite tournaments. - Diego González-Moreno; Camino Balbuena; Mika Olsen (Electron. Notes Discret. Math., 2016)

CKI-Digraphs, Generalized Sums and Partitions of Digraphs. - Hortensia Galeana-Sánchez; Mika Olsen (Graphs Comb., 2016)

A Characterization of Locally Semicomplete CKI-digraphs. - Hortensia Galeana-Sánchez; Mika Olsen (Graphs Comb., 2016)

Disproof of a Conjecture of Neumann-Lara. - Bernardo Llano; Mika Olsen (Electron. J. Comb., 2017)

Infinite quasi-transitive digraphs with domination number 2. - Hortensia Galeana-Sánchez; Mika Olsen (Discret. Appl. Math., 2017)

The minimum feedback arc set problem and the acyclic disconnection for graphs. - Ana Paulina Figueroa; César Hernández-Cruz; Mika Olsen (Discret. Math., 2017)

Bounds on the k-restricted arc connectivity of some bipartite tournaments. - Camino Balbuena; Diego González-Moreno; Mika Olsen (Appl. Math. Comput., 2018)

The Diachromatic Number of Digraphs. - Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros; Mika Olsen; Christian Rubio-Montiel (Electron. J. Comb., 2018)

Rainbow connectivity of Moore cages of girth 6. - Camino Balbuena; Julián Fresán-Figueroa; Diego González-Moreno; Mika Olsen (Discret. Appl. Math., 2018)

Vertex disjoint 4-cycles in bipartite tournaments. - Camino Balbuena; Diego González-Moreno; Mika Olsen (Discret. Math., 2018)

Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments. - Hortensia Galeana-Sánchez; Mika Olsen (Discret. Math. Theor. Comput. Sci., 2018)

Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six. - Jorge Cervantes-Ojeda; María del Carmen Gómez Fuentes; Diego González-Moreno; Mika Olsen (J. Appl. Math., 2019)

On the packing chromatic number of Moore graphs. - Julián Fresán-Figueroa; Diego González-Moreno; Mika Olsen (Discret. Appl. Math., 2021)

Achromatic numbers for circulant graphs and digraphs. - Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros; Mika Olsen; Christian Rubio-Montiel (Discuss. Math. Graph Theory, 2021)

The digrundy number of digraphs. - Gabriela Araujo-Pardo; Juan José Montellano-Ballesteros; Mika Olsen; Christian Rubio-Montiel (Discret. Appl. Math., 2022)

The Dichromatic Polynomial of a Digraph. - Diego González-Moreno; Rangel Hernández-Ortiz; Bernardo Llano; Mika Olsen (Graphs Comb., 2022)

Computacional complexity of Hajós constructions of symmetric odd cycles. - Jorge Cervantes-Ojeda; Juan Carlos García-Altamirano; Mika Olsen (LAGOS, 2023)

How to construct the symmetric cycle of length 5 using Hajós construction with an adapted Rank Genetic Algorithm. - Juan Carlos García-Altamirano; Mika Olsen; Jorge Cervantes-Ojeda (Discret. Math. Theor. Comput. Sci., 2023)

Special structures in Q(4,q), projective planes and its application in L(h,k)-colorings of their Moore Graphs. - Julián Fresán-Figueroa; Diego González-Moreno; Mika Olsen (Discret. Appl. Math., 2023)

Partition of regular balanced c-tournaments into strongly connected c-tournaments. - Ana Paulina Figueroa; Juan José Montellano-Ballesteros; Mika Olsen (Discret. Math., 2023)

Hamiltonian connected balanced multipartite tournaments and hamiltonian connected partitions. - Ana Paulina Figueroa; Juan José Montellano-Ballesteros; Mika Olsen (Australas. J Comb., 2025)