![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Mika Olsen
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j33]Julián Fresán-Figueroa, Diego González-Moreno
, Mika Olsen:
Special structures in Q(4,q), projective planes and its application in L(h,k)-colorings of their Moore Graphs. Discret. Appl. Math. 331: 31-37 (2023) - [j32]Ana Paulina Figueroa, Juan José Montellano-Ballesteros
, Mika Olsen:
Partition of regular balanced c-tournaments into strongly connected c-tournaments. Discret. Math. 346(7): 113459 (2023) - [j31]Juan Carlos García-Altamirano, Mika Olsen, Jorge Cervantes-Ojeda:
How to construct the symmetric cycle of length 5 using Hajós construction with an adapted Rank Genetic Algorithm. Discret. Math. Theor. Comput. Sci. 25 (2023) - [c1]Jorge Cervantes-Ojeda, Juan Carlos García-Altamirano, Mika Olsen:
Computacional complexity of Hajós constructions of symmetric odd cycles. LAGOS 2023: 112-120 - 2022
- [j30]Gabriela Araujo-Pardo
, Juan José Montellano-Ballesteros
, Mika Olsen, Christian Rubio-Montiel
:
The digrundy number of digraphs. Discret. Appl. Math. 317: 117-123 (2022) - [j29]Diego González-Moreno
, Rangel Hernández-Ortiz, Bernardo Llano, Mika Olsen:
The Dichromatic Polynomial of a Digraph. Graphs Comb. 38(3): 85 (2022) - [i1]Juan Carlos García-Altamirano, Mika Olsen, Jorge Cervantes-Ojeda:
How to construct the symmetric cycle of length 5 using Hajós construction with an adapted Rank Genetic Algorithm. CoRR abs/2210.05080 (2022) - 2021
- [j28]Julián Fresán-Figueroa, Diego González-Moreno, Mika Olsen:
On the packing chromatic number of Moore graphs. Discret. Appl. Math. 289: 185-193 (2021) - [j27]Gabriela Araujo-Pardo
, Juan José Montellano-Ballesteros
, Mika Olsen, Christian Rubio-Montiel
:
Achromatic numbers for circulant graphs and digraphs. Discuss. Math. Graph Theory 41(3): 713-724 (2021)
2010 – 2019
- 2019
- [j26]Jorge Cervantes-Ojeda, María del Carmen Gómez Fuentes
, Diego González-Moreno, Mika Olsen:
Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six. J. Appl. Math. 2019: 4073905:1-4073905:7 (2019) - 2018
- [j25]Camino Balbuena
, Diego González-Moreno
, Mika Olsen:
Bounds on the k-restricted arc connectivity of some bipartite tournaments. Appl. Math. Comput. 331: 54-60 (2018) - [j24]Gabriela Araujo-Pardo
, Juan José Montellano-Ballesteros
, Mika Olsen, Christian Rubio-Montiel
:
The Diachromatic Number of Digraphs. Electron. J. Comb. 25(3): 3 (2018) - [j23]Camino Balbuena
, Julián Fresán-Figueroa
, Diego González-Moreno
, Mika Olsen
:
Rainbow connectivity of Moore cages of girth 6. Discret. Appl. Math. 250: 104-109 (2018) - [j22]Camino Balbuena
, Diego González-Moreno
, Mika Olsen
:
Vertex disjoint 4-cycles in bipartite tournaments. Discret. Math. 341(4): 1103-1108 (2018) - [j21]Hortensia Galeana-Sánchez, Mika Olsen:
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. 20(2) (2018) - 2017
- [j20]Bernardo Llano, Mika Olsen:
Disproof of a Conjecture of Neumann-Lara. Electron. J. Comb. 24(4): 4 (2017) - [j19]Hortensia Galeana-Sánchez, Mika Olsen
:
Infinite quasi-transitive digraphs with domination number 2. Discret. Appl. Math. 226: 44-50 (2017) - [j18]Ana Paulina Figueroa
, César Hernández-Cruz
, Mika Olsen
:
The minimum feedback arc set problem and the acyclic disconnection for graphs. Discret. Math. 340(7): 1514-1521 (2017) - 2016
- [j17]Ana Paulina Figueroa
, Juan José Montellano-Ballesteros
, Mika Olsen
:
Strong subtournaments and cycles of multipartite tournaments. Discret. Math. 339(11): 2793-2803 (2016) - [j16]Diego González-Moreno
, Camino Balbuena, Mika Olsen
:
Vertex-disjoint cycles in bipartite tournaments. Electron. Notes Discret. Math. 54: 69-72 (2016) - [j15]Hortensia Galeana-Sánchez, Mika Olsen
:
CKI-Digraphs, Generalized Sums and Partitions of Digraphs. Graphs Comb. 32(1): 123-131 (2016) - [j14]Hortensia Galeana-Sánchez, Mika Olsen
:
A Characterization of Locally Semicomplete CKI-digraphs. Graphs Comb. 32(5): 1873-1879 (2016) - 2015
- [j13]Camino Balbuena, Mika Olsen
:
On the acyclic disconnection and the girth. Discret. Appl. Math. 186: 13-18 (2015) - [j12]Ana Paulina Figueroa
, Mika Olsen
, Rita Zuazua:
On the vertices of a 3-partite tournament not in triangles. Discret. Math. 338(11): 1982-1988 (2015) - 2013
- [j11]Victor Neumann-Lara, Mika Olsen:
Molds of regular tournaments. Ars Comb. 112: 81-96 (2013) - [j10]Hortensia Galeana-Sánchez, Mika Olsen
:
Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3. Discret. Math. 313(13): 1464-1474 (2013) - 2012
- [j9]Ana Paulina Figueroa, Mika Olsen:
The tight bound on the number of C_3-free vertices on regular 3-partite tournaments. Australas. J Comb. 52: 209-214 (2012) - [j8]Ana Paulina Figueroa
, Bernardo Llano, Mika Olsen
, Eduardo Rivera-Campo:
On the acyclic disconnection of multipartite tournaments. Discret. Appl. Math. 160(10-11): 1524-1531 (2012) - 2011
- [j7]Hortensia Galeana-Sánchez, Mika Olsen
:
Kernels by monochromatic paths in digraphs with covering number 2. Discret. Math. 311(13): 1111-1118 (2011) - 2010
- [j6]Gabriela Araujo-Pardo
, Mika Olsen
:
A conjecture of Neumann-Lara on infinite families of r-dichromatic circulant tournaments. Discret. Math. 310(3): 489-492 (2010)
2000 – 2009
- 2009
- [j5]Victor Neumann-Lara, Mika Olsen:
Enumeration and dichromatic number of tame tournaments. Australas. J Comb. 45: 25-36 (2009) - [j4]Gabriela Araujo-Pardo, Camino Balbuena, Mika Olsen:
On (k, g; l)-dicages. Ars Comb. 92 (2009) - 2008
- [j3]Bernardo Llano, Mika Olsen
:
On a Conjecture of Víctor Neumann-Lara. Electron. Notes Discret. Math. 30: 207-212 (2008) - 2007
- [j2]Bernardo Llano, Mika Olsen
:
Infinite families of tight regular tournaments. Discuss. Math. Graph Theory 27(2): 299-311 (2007) - [j1]Gabriela Araujo-Pardo
, Mika Olsen
:
Infinite families of (n+1)-dichromatic vertex critical circulant tournaments. Electron. Notes Discret. Math. 28: 141-144 (2007)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint