Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Mika Olsen"'
Publikováno v:
Discrete Mathematics Letters, Vol 14, Pp 7-12 (2024)
Externí odkaz:
https://doaj.org/article/2b8a1492fc8e43f2a76a9f4ac4d0ff1c
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol vol. 25:1, Iss Discrete Algorithms (2023)
In 2020 Bang-Jensen et. al. generalized the Haj\'os join of two graphs to the class of digraphs and generalized several results for vertex colorings in digraphs. Although, as a consequence of these results, a digraph can be obtained by Haj\'os constr
Externí odkaz:
https://doaj.org/article/6ea2aa2bc8ac45beaa3eef5411108c44
Autor:
Mika Olsen, Alejandra Silva Ramíırez
Publikováno v:
Miscelánea Matemática de la Sociedad Matemática Mexicana. 75:87-98
Publikováno v:
Discrete Mathematics. 346:113459
We extend the Grundy number and the ochromatic number, parameters on graph colorings, to digraph colorings, we call them {\emph{digrundy number}} and {\emph{diochromatic number}}, respectively. First, we prove that for every digraph the diochromatic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8708eec0156714c3665b5e849021abe7
http://arxiv.org/abs/2103.11917
http://arxiv.org/abs/2103.11917
Publikováno v:
Discrete Mathematics. 340:1514-1521
A minimum feedback arc set of a digraph D is a minimum set of arcs which removal leaves the resultant graph free of directed cycles; its cardinality is denoted by τ 1 ( D ) . The acyclic disconnection of D , ω ( D ) , is defined as the maximum numb
Autor:
Hortensia Galeana-Sánchez, Mika Olsen
Publikováno v:
Discrete Applied Mathematics. 226:44-50
In 2014 D. Palvolgyi and A. Gyarfas explored the minimum dominating set of a digraph with an arc partition into transitive digraphs. A. Gyarfas proposed the conjecture “ for each positive integer k , there exists a (least) p ( k ) such that every k
Publikováno v:
Discrete Mathematics. 339:2793-2803
In this paper we relate the global irregularity and the order of a c -partite tournament T to the existence of certain cycles and the problem of finding the maximum strongly connected subtournament of T . In particular, we give results related to the
Publikováno v:
Journal of Applied Mathematics, Vol 2019 (2019)
J. Appl. Math.
J. Appl. Math.
Arainbowt-coloringof at-connected graphGis an edge coloring such that for any two distinct verticesuandvofGthere are at leasttinternally vertex-disjoint rainbow(u,v)-paths. In this work, we apply a Rank Genetic Algorithm to search for rainbowt-colori
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 41, Iss 3, Pp 713-724 (2021)
In this paper, we determine the achromatic and diachromatic numbers of some circulant graphs and digraphs each one with two lengths and give bounds for other circulant graphs and digraphs with two lengths. In particular, for the achromatic number we