Mika Olsen

Orcid: 0000-0001-7426-113X

According to our database1, Mika Olsen authored at least 35 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Partition of regular balanced <i>c</i>-tournaments into strongly connected <i>c</i>-tournaments.
Discret. Math., July, 2023

Special structures in Q(4,q), projective planes and its application in L(h,k)-colorings of their Moore Graphs.
Discret. Appl. Math., May, 2023

How to construct the symmetric cycle of length 5 using Hajós construction with an adapted Rank Genetic Algorithm.
Discret. Math. Theor. Comput. Sci., 2023

Computacional complexity of Hajós constructions of symmetric odd cycles.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
The Dichromatic Polynomial of a Digraph.
Graphs Comb., 2022

The digrundy number of digraphs.
Discret. Appl. Math., 2022

2021
Achromatic numbers for circulant graphs and digraphs.
Discuss. Math. Graph Theory, 2021

On the packing chromatic number of Moore graphs.
Discret. Appl. Math., 2021

2019
Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six.
J. Appl. Math., 2019

2018
Solving the kernel perfect problem by (simple) forbidden subdigraphs for digraphs in some families of generalized tournaments and generalized bipartite tournaments.
Discret. Math. Theor. Comput. Sci., 2018

Vertex disjoint 4-cycles in bipartite tournaments.
Discret. Math., 2018

Rainbow connectivity of Moore cages of girth 6.
Discret. Appl. Math., 2018

The Diachromatic Number of Digraphs.
Electron. J. Comb., 2018

Bounds on the <i>k</i>-restricted arc connectivity of some bipartite tournaments.
Appl. Math. Comput., 2018

2017
The minimum feedback arc set problem and the acyclic disconnection for graphs.
Discret. Math., 2017

Infinite quasi-transitive digraphs with domination number 2.
Discret. Appl. Math., 2017

Disproof of a Conjecture of Neumann-Lara.
Electron. J. Comb., 2017

2016
A Characterization of Locally Semicomplete CKI-digraphs.
Graphs Comb., 2016

CKI-Digraphs, Generalized Sums and Partitions of Digraphs.
Graphs Comb., 2016

Vertex-disjoint cycles in bipartite tournaments.
Electron. Notes Discret. Math., 2016

Strong subtournaments and cycles of multipartite tournaments.
Discret. Math., 2016

2015
On the vertices of a 3-partite tournament not in triangles.
Discret. Math., 2015

On the acyclic disconnection and the girth.
Discret. Appl. Math., 2015

2013
Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3.
Discret. Math., 2013

Molds of regular tournaments.
Ars Comb., 2013

2012
On the acyclic disconnection of multipartite tournaments.
Discret. Appl. Math., 2012

The tight bound on the number of C_3-free vertices on regular 3-partite tournaments.
Australas. J Comb., 2012

2011
Kernels by monochromatic paths in digraphs with covering number 2.
Discret. Math., 2011

2010
A conjecture of Neumann-Lara on infinite families of r-dichromatic circulant tournaments.
Discret. Math., 2010

2009
On (k, g; l)-dicages.
Ars Comb., 2009

Enumeration and dichromatic number of tame tournaments.
Australas. J Comb., 2009

2008
On a Conjecture of Víctor Neumann-Lara.
Electron. Notes Discret. Math., 2008

2007
Infinite families of (n+1)-dichromatic vertex critical circulant tournaments.
Electron. Notes Discret. Math., 2007

Infinite families of tight regular tournaments.
Discuss. Math. Graph Theory, 2007

2005
Coloraciones y conjuntos aciclicos en digraficas
PhD thesis, 2005


  Loading...