Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Barbara Maenhaut"'
Publikováno v:
Journal of Combinatorial Designs. 26:595-615
The notion of uniformity, as in uniform 1 -factorisations, extends naturally to graph decompositions generally. The existence of uniform decompositions of complete multigraphs into cycles is investigated and some connections with families of classica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::403a2b2b2dd572c36940a36d02cebace
https://doi.org/10.1002/jcd.21630
https://doi.org/10.1002/jcd.21630
Publikováno v:
Journal of Combinatorial Theory, Series B. 129:79-106
We establish necessary and sufficient conditions for the existence of a decomposition of a complete multigraph into edge-disjoint cycles of specified lengths, or into edge-disjoint cycles of specified lengths and a perfect matching.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3070b8318f39a5940bf616f2e8ce1a12
https://doi.org/10.1016/j.jctb.2017.09.005
https://doi.org/10.1016/j.jctb.2017.09.005
Publikováno v:
Ars mathematica contemporanea
Scopus-Elsevier
Scopus-Elsevier
Various results on factorisations of complete graphs into circulant graphs and on 2-factorisations of these circulant graphs are proved. As a consequence, a number of new results on the Oberwolfach Problem are obtained. For example, a complete soluti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4508769f13f7da7ee18b844005b5a9f6
https://doi.org/10.26493/1855-3974.770.150
https://doi.org/10.26493/1855-3974.770.150
Autor:
Benjamin R. Smith, Barbara Maenhaut
Publikováno v:
Journal of Graph Theory. 82:296-311
Suppose M=m1,m2,.,mr and N=n1,n2,.,nt are arbitrary lists of positive integers. In this article, we determine necessary and sufficient conditions on M and N for the existence of a simple graph G, which admits a face 2-colorable planar embedding in wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::517043c37f089908a2be3dc151db1335
https://doi.org/10.1002/jgt.21902
https://doi.org/10.1002/jgt.21902
Publikováno v:
University of Queensland
In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line gra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dbde85a66a0352b163b715ad2ae06b60
http://arxiv.org/abs/1710.06037
http://arxiv.org/abs/1710.06037
Autor:
Barbara Maenhaut, Sarada Herke
Publikováno v:
Journal of Combinatorial Designs. 23:369-399
A 1-factorization of a graph G is a decomposition of G into edge-disjoint 1-factors (perfect matchings), and a perfect 1-factorization is a 1-factorization in which the union of any two of the 1-factors is a Hamilton cycle. We consider the problem of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::47f27061782b518f124d848c5d9483e3
https://doi.org/10.1002/jcd.21399
https://doi.org/10.1002/jcd.21399
Publikováno v:
SIAM Journal on Discrete Mathematics. 26:239-249
We show that for all integers $m \geqslant 4$ there exists a $2m\times 2m\times m$ latin cuboid that cannot be completed to a $2m\times 2m\times 2m$ latin cube. We also show that for all even $m>2$ there exists a $(2m{-}1)\times(2m{-}1)\times(m{-}1)$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3b7d92ad3785a815f1b087a2d132e75d
https://doi.org/10.1137/110825534
https://doi.org/10.1137/110825534
Publikováno v:
Combinatorica. 31:507-528
We establish new lower bounds on the pair covering number C λ (υ,k) for infinitely many values of υ, k and λ, including infinitely many values of υ and k for λ=1. Here, C λ (υ,k) denotes the minimum number of k-subsets of a υ-set of points s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e6ebc0f7cc3d4e87b320e113784dc199
https://doi.org/10.1007/s00493-011-2639-y
https://doi.org/10.1007/s00493-011-2639-y
Publikováno v:
Journal of Combinatorial Designs. 19:42-69
In this paper we establish necessary and sufficient conditions for decomposing the complete multigraph lambda K(n) into cycles of length lambda, and the lambda-fold complete symmetric digraph lambda K(n)*, into directed cycles of length lambda. As a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9366ea8a4ac254beb3a73ad2beaee746
https://doi.org/10.1002/jcd.20263
https://doi.org/10.1002/jcd.20263
Publikováno v:
Designs, Codes and Cryptography. 52:93-105
A k-plex is a selection of kn entries of a latin square of order n in which each row, column and symbol is represented precisely k times. A transversal of a latin square corresponds to the case k = 1. A k-plex is said to be indivisible if it contains
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::797c581c672efbb40a8fc6013372ddea
https://doi.org/10.1007/s10623-009-9269-z
https://doi.org/10.1007/s10623-009-9269-z