Výsledky vyhľadávania
Názov Decompositions of complete graphs into circulants Aut.údaje Mariusz Meszka ... [et al.] Autor Meszka Mariusz (25%)
Spoluautori Nedela Roman 1960- (25%) UMBFP05 - Katedra informatiky
Rosa Alexander 1937- (25%) UMBFP10 - Katedra matematiky
Škoviera Martin (25%)
Zdroj.dok. Discrete Mathematics. Vol. 339, no. 10 (2016), pp. 2471-2480. - Amsterdam : Elsevier B.V., 2016 Poznámka This work is based upon work supported by the Project: Mobility-enhancing research, science and education at Matej Bel University, ITMS code: 26110230082, under the Operational Program Education cofinanced by the European Social Fund. Kľúč.slová dekompozícia decomposition grafy - charts - graphs Jazyk dok. angličtina Krajina Holandsko Systematika 51 Kategória publikačnej činnosti ADM Číslo archívnej kópie 36705 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ Odkazy PERIODIKÁ-Súborný záznam periodika Title Maximal designs and configurations - a survey Author info Alexander Rosa Author Rosa Alexander 1937- (100%) UMBFP10 - Katedra matematiky
Source document Acta Universitatis Matthiae Belii : series Mathematics, No. 23. S. 9-25. - Banská Bystrica : Vydavateľstvo Univerzity Mateja Bela - Belianum : Matej Bel University, Faculty of Natural Science, 2015 / Haviar Miroslav 1965- Keywords designs configurations maximal sets packings Language English Country Slovak Republic systematics 929 Public work category AED No. of Archival Copy 36961 Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ Title On a problem of Mariusz Meszka Author info Alexander Rosa Author Rosa Alexander 1937- (100%) UMBFP10 - Katedra matematiky
Source document Discrete Mathematics. Vol. 338, no. 1 (2015), pp. 139-143. - Amsterdam : Elsevier B.V., 2015 Keywords matematika - mathematics grafy - charts - graphs Language English Country Netherlands systematics 51 Annotation © 2014 Elsevier B.V.We consider a problem due to Mariusz Meszka similar to the well-known conjecture of Marco Buratti. Does there exist a near-1-factor in the complete graph on Zp, p is an odd prime, whose set of edge-lengths equals a given multiset L? We establish several sufficient conditions for the answer to be yes. Public work category ADM No. of Archival Copy 36746 Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ References PERIODIKÁ-Súborný záznam periodika Title Combinatorial designs with applications Subtitle notes Author info Alexander Rosa Author Rosa Alexander 1937- (100%) UMBFP10 - Katedra matematiky
Issue data Banská Bystrica : Vydavateľstvo Univerzity Mateja Bela - Belianum , 2015. - [60] s. Issue 1. vyd. ISBN 978-80-557-1049-5 Keywords kombinatorika - kombinatorická analýza - combinatorics - combinatorial analysis matematické aplikácie mathematical applications Language English Country Slovak Republic systematics 51 Public work category BAB No. of Archival Copy 35515 Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ Title The chromatic number of 5-valent circulants Author info Marius Meszka, Roman Nedela, Alexander Rosa Author Meszka Mariusz (34%)
Co-authors Nedela Roman 1960- (33%) UMBFP10 - Katedra matematiky
Rosa Alexander 1937- (33%)
Source document Discrete Mathematics. Roč. 308 (2008), s. 6269-6284. - Amsterdam : Elsevier B. V., 2008 Keywords chromatic numbers circulants Language English Country Netherlands systematics 51 Public work category ADE No. of Archival Copy 9896 Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ Title Circulants and the chromatic index of Steiner Triple Systems Par.title Cirkulanty a chromatický index šteinerovských systémov trojíc Author info Mariusz Meszka, Roman Nedela, Alex Rosa Author Meszka Mariusz
Co-authors Nedela Roman 1960- UMBUV01 - Ústav vedy a výskumu
Rosa Alexander 1937-
Source document Mathematica Slovaca. Vol. 56, no. 4 (2006), pp. 371-378. - Bratislava : Slovenská akadémia vied, Matematický ústav SAV, 2006 Keywords cirkulanty chromatické indexy circulants chromatic indexes Steiner triple system Language English Country Slovak Republic systematics 51 Public work category ADF No. of Archival Copy 4611 Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ References PERIODIKÁ-Súborný záznam periodika Title The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors Author info P. Horak, R. Nedela, A. Rosa Author Horak P. (34%)
Co-authors Nedela Roman 1960- (33%) UMBFP12 - Inštitút matematiky a informatiky
Rosa Alexander 1937- (33%)
Source document Discrete Mathematics. Vol. 284 284, no. 1-3 (2004), pp. 181-188. - Amsterdam : Elsevier B.V., 2004 Keywords matematika - mathematics Hamiltonský cyklus Hamiltonian cycle Language English Country Netherlands systematics 51 Annotation We discuss a special case of the Hamilton-Waterloo problem in which a 2-factorization of K-n is sought consisting of 2-factors of two kinds: Hamiltonian cycles, and triangle-factors. We determine completely the spectrum of solutions for several infinite classes of orders n. Public work category ADE No. of Archival Copy 28526 Repercussion category KERANEN, Melissa S. - OZKAN, Sibel. The Hamilton-Waterloo problem with 4-cycles and a single factor of n-cycles. In Graphs and combinatorics. ISSN 0911-0119, 2013, vol. 29, no. 6, pp. 1827-1837.
BRYANT, Darryn - DANZIGER, Peter - DEAN, Matthew. On the Hamilton-Waterloo problem for bipartite 2-factors. In Journal of combinatorial designs. ISSN 1063-8539, 2013, vol. 21, no. 2, pp. 60-80.
SANGEETHA, R. - MUTHUSAMY, A. Hamilton cycle rich 2-factorization of complete equipartite graphs-II. In Graphs and combinatorics. ISSN 0911-0119, 2012, vol. 28, no. 6, pp. 877-887.
SHYU, Tay-Woei. Decomposition of complete graphs into paths of length three and triangles. In Ars combinatoria. ISSN 0381-7032, 2012, vol. 107, pp. 209-224.
LEI, Hongchuan - SHEN, Hao. The Hamilton-Waterloo problem for Hamilton cycles and Triangle-factors. In Journal of combinatorial designs. ISSN 1063-8539, 2012, vol. 20, no. 7, pp. 305-316.
BRYANT, Darryn - DANZIGER, Peter. On bipartite 2-factorizations of K-n-I and the oberwolfach problem. In Journal of graph theory. ISSN 0364-9024, 2011, vol. 68, no. 1, pp. 22-37.
LEI, Hongchuan - FU, Hung-Lin - SHEN, Hao. The Hamilton-Waterloo problem for Hamilton cycles and C-4k-factors. In Ars combinatoria. ISSN 0381-7032, 2011, vol. 100, no., pp. 341-348.
JORDON, Heather. Alspach´s problem : the case of Hamilton cycles and 5-cycles. In Electronic journal of combinatorics [online]. 2011, vol. 18, no. 1, article no. P82 [cit. 2014-03-05]. ISSN 1077-8926. Dostupné na: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p82/pdf
OZKAN, Sibel - RODGER, C. A. Hamilton decompositions of graphs with primitive complements. In Discrete mathematics. ISSN 0012-365X, 2009, vol. 309, no. 14, pp. 4883-4888.
OZKAN, Sibel - RODGER, C. A. Hamilton decompositions of balanced complete multipartite graphs with primitive leaves. In Discrete mathematics. ISSN 0012-365X, 2010, vol. 310, no. 13-14, pp. 1965-1973.
DANZIGER, Peter - QUATTROCCHI, Gaetano - STEVENS, Brett. The Hamilton-Waterloo problem for cycle sizes 3 and 4. In Journal of combinatorial designs. ISSN 1063-8539, 2009, vol. 17, no. 4, pp. 342-352.
DINITZ, J. H. - LING, Alan C. H. The Hamilton-Waterloo problem : the case of triangle-factors and one Hamilton cycle. In Journal of combinatorial designs. ISSN 1063-8539, 2009, vol. 17, no. 2, pp. 160-176.
FU, Hung-Lin - HUANG, Kuo-Ching. The Hamilton-Waterloo problem for two even cycles factors. In Taiwanese journal of mathematics. ISSN 1027-5487, 2008, vol. 12, no. 4, pp. 933-940.
SANGEETHA, R. - MUTHUSAMY, A. Hamilton-Waterloo problem : existence of larger order from smaller order. In Journal of combinatorial mathematics and combinatorial computing. ISSN 0835-3026, 2013, vol. 84, pp. 137-143.
LING, A. C. H. - DINITZ, J. H. The Hamilton-Waterloo problem with triangle-factors and Hamilton cycles : the case n ≡ 3 (mod 18). In Journal of combinatorial mathematics and combinatorial computing. ISSN 0835-3026, 2009, vol. 70, pp. 143-147.
ADAMS, P. - BEYANT, D. Two-factorisations of complete graphs of orders fifteen and seventeen. In Australasian journal of combinatorics. ISSN 1034-4942, 2006, vol. 35, pp. 113-118.
Catal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Database xpca - PUBLIKAČNÁ ČINNOSŤ References PERIODIKÁ-Súborný záznam periodika