Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Artur Fortuna"'
Autor:
Artur Fortuna, Zdzisław Skupień
Publikováno v:
Opuscula Mathematica, Vol 33, Iss 4, Pp 685-696 (2013)
It is shown that there is no digraph \(F\) which could decompose the complete digraph on 5 vertices minus any 2-arc remainder into three parts isomorphic to \(F\) for each choice of the remainder. On the other hand, for each \(n\ge3\) there is a univ
Externí odkaz:
https://doaj.org/article/cb2060dad4ee4520be299905259abde7
Autor:
Zdzisław Skupień, Artur Fortuna
Publikováno v:
Opuscula Mathematica, Vol 33, Iss 4, Pp 685-696 (2013)
It is shown that there is no digraph \(F\) which could decompose the complete digraph on 5 vertices minus any 2-arc remainder into three parts isomorphic to \(F\) for each choice of the remainder. On the other hand, for each \(n\ge3\) there is a univ
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::69c1aa422b71e8b6f0787a5c2e3508d0
http://www.opuscula.agh.edu.pl/vol33/4/art/opuscula_math_3338.pdf
http://www.opuscula.agh.edu.pl/vol33/4/art/opuscula_math_3338.pdf
Publikováno v:
Discrete Mathematics. 309:1788-1792
Sharp exponential upper bound, k!^n^-^1, on the number of hamiltonian k-sets (i.e., decompositions into k hamiltonian cycles) among multigraphs G is found if the number, n, of vertices is fixed, n>=3. Moreover, the upper bound is attained iff G=Cnk w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::628080b13396a733fa0523169a5a6364
https://doi.org/10.1016/j.disc.2008.03.008
https://doi.org/10.1016/j.disc.2008.03.008