Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Marta Borowiecka-Olszewska"'
Publikováno v:
Discussiones Mathematicae Probability and Statistics. 23:77
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5a278b37d45854be13baea11b804af29
https://doi.org/10.7151/dmps.1037
https://doi.org/10.7151/dmps.1037
Publikováno v:
Results in Mathematics. 76
We consider arc colourings of oriented graphs such that for each vertex the colours of all out-arcs incident with the vertex and the colours of all in-arcs incident with the vertex form intervals. We prove that the existence of such a colouring is an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b33a8940590e505674f9322413428dd4
https://doi.org/10.1007/s00025-021-01505-3
https://doi.org/10.1007/s00025-021-01505-3
Publikováno v:
Discussiones Mathematicae Graph Theory, Vol 37, Iss 2, Pp 315-336 (2017)
A consecutive colouring of a graph is a proper edge colouring with natural numbers in which the colours of edges incident with each vertex form an interval of integers. The idea of this colouring was introduced in 1987 by Asratian and Kamalian [1] fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70e8984f38b2abb4cf348ec5853abe22
https://doaj.org/article/66c5386b18f74bc3b0f2d5751b79ed90
https://doaj.org/article/66c5386b18f74bc3b0f2d5751b79ed90
Publikováno v:
Discrete Mathematics. 339:1892-1908
A?proper edge colouring of a?graph with natural numbers is consecutive if colours of edges incident with each vertex form an?interval of integers. The?deficiency def ( G ) of a?graph G is the?minimum number of pendant edges whose attachment to G make
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae39fb1a245eff1f0990c2692b4e3e8b
https://doi.org/10.1016/j.disc.2015.12.028
https://doi.org/10.1016/j.disc.2015.12.028
Publikováno v:
Discrete Applied Mathematics. 201:24-37
A?proper edge colouring of a?graph with natural numbers is consecutive if colours of edges incident with each vertex form a?consecutive interval of integers. The?deficiency d e f ( G ) of a?graph G is the?minimum number of pendant edges whose attachm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bcd617756ed9f1d5dc67876d7a87204a
https://doi.org/10.1016/j.dam.2015.08.008
https://doi.org/10.1016/j.dam.2015.08.008
Publikováno v:
Journal of Mathematical Sciences. 121:2674-2680
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2349b1862e97d285022d03a9239bfed8
https://doi.org/10.1023/b:joth.0000027033.17054.21
https://doi.org/10.1023/b:joth.0000027033.17054.21
Publikováno v:
Bernoulli 21, no. 4 (2015), 2513-2551
In this paper, we present a comprehensive theory of generalized and weak generalized convolutions, illustrate it by a large number of examples, and discuss the related infinitely divisible distributions. We consider L\'{e}vy and additive process with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7a008d271695a60d1edaf63129b60d4f
http://arxiv.org/abs/1312.4083
http://arxiv.org/abs/1312.4083
Publikováno v:
Discrete Mathematics. (1-2):31-36
Let P be a property of graphs. A graph G is vertex (P,k)-colourable if the vertex set V(G) of G can be partitioned into k sets V1,V2,…,Vk such that the subgraph G[Vi] of G belongs to P, i=1,2,…,k. If P is a hereditary property, then the set of mi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b9cf9659e03e23dfce7984715031d27