Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Mariusz Meszka"'
Publikováno v:
Opuscula Mathematica, Vol 24, Iss 1, Pp 97-102 (2004)
We establish the computational time complexity of the existence problem of a decomposition of an instance multigraph into isomorphic 3-vertex paths with multiple edges. If the two edge multiplicities are distinct, the problem is NPC; if mutually equa
Externí odkaz:
https://doaj.org/article/79fa654fd8424c30be1c08a0feadcea2
Autor:
Mariusz Meszka, Alexander Rosa
Publikováno v:
Mathematica Slovaca. 71:543-564
In this article, we attempt to survey all that has been written about 6-cycle systems. In addition, several new results, including many enumeration results, are included here for the first time. Our survey concludes with a list of open problems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b2521af64cc65d14ecc0cf77d263b2ec
https://doi.org/10.1515/ms-2021-0003
https://doi.org/10.1515/ms-2021-0003
Autor:
Mariusz Meszka
Publikováno v:
Journal of Combinatorial Designs. 28:85-94
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e72c33207eba728313101a80d9a23d5
https://doi.org/10.1002/jcd.21683
https://doi.org/10.1002/jcd.21683
Autor:
Mariusz Meszka
Publikováno v:
Discrete Mathematics. 341:3237-3240
The main results provide sufficient conditions for balanced bipartite digraphs to be bipancyclic. These are analogues to well-known results on pancyclic digraphs.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::abb3b7403d469a93bb85cd5cd3fd82c9
https://doi.org/10.1016/j.disc.2018.08.004
https://doi.org/10.1016/j.disc.2018.08.004
Autor:
Mariusz Meszka, Magdalena Tyniec
Publikováno v:
Designs, Codes and Cryptography. 87:987-993
The paper provides a complete solution to the existence problem of two orthogonal one-factorizations of a complete balanced multipartite graph $$K_{p\times q}$$ . In particular, new classes of Howell designs are constructed.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3106a6425e9e131e760e8c1564919c59
https://doi.org/10.1007/s10623-018-0504-3
https://doi.org/10.1007/s10623-018-0504-3
Autor:
Alexander Rosa, Mariusz Meszka
Publikováno v:
Electronic Notes in Discrete Mathematics. 60:33-37
We extend the well-known notion of a ρ-labelling for ordinary graphs to 3-uniform hypergraphs, and discuss its connection to decompositions of the complete 3-uniform hypergraph.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c46ecd2f0840379c0903fdb8709cb756
https://doi.org/10.1016/j.endm.2017.06.005
https://doi.org/10.1016/j.endm.2017.06.005
Autor:
Magdalena Tyniec, Mariusz Meszka
Publikováno v:
Graphs and Combinatorics. 33:1451-1458
A maximal edge-coloring of a graph G of order n is a proper edge-coloring of G with $$\chi '(K_n)$$ colors such that no edge of the complement $$\overline{G}$$ of G can be attached to G without violating conditions of a proper edge-coloring. We almos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44ef0433595a09108a5f447ad8496202
https://doi.org/10.1007/s00373-017-1797-0
https://doi.org/10.1007/s00373-017-1797-0
Publikováno v:
Discrete Mathematics. 339:2471-2480
We initiate a systematic study of decompositions of the complete graph into circulants. Among other things, we completely determine the existence spectrum for Moebius ladders M 4 , M 5 , M 6 and the prism P r 5 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2b87153f816beb1b08c4afdbbd1a8a21
https://doi.org/10.1016/j.disc.2016.04.009
https://doi.org/10.1016/j.disc.2016.04.009
Publikováno v:
Designs, Codes and Cryptography. 77:321-333
We prove that an almost $$2$$2-perfect $$6$$6-cycle system of order $$n$$n exists if and only if $$n \equiv 1$$n?1 or $$9\ (mod\ 12)$$9(mod12), and that an almost $$2$$2-perfect maximum packing with $$6$$6-cycles of order $$n$$n exists for all $$n \g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e1e8119b9156e58cf55ef0665aeada4d
https://doi.org/10.1007/s10623-015-0049-7
https://doi.org/10.1007/s10623-015-0049-7
Publikováno v:
Discrete Mathematics. 313:1872-1883
In a simple twofold triple system ( X , B ) , any two distinct triples T 1 , T 2 with | T 1 ∩ T 2 | = 2 form a matched pair. Let F be a pairing of the triples of B into matched pairs (if possible). Let D be the collection of double edges belonging
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dfd6a23bff3252062ef5f79a3ab41990
https://doi.org/10.1016/j.disc.2011.12.006
https://doi.org/10.1016/j.disc.2011.12.006