Výsledky vyhľadávania

Nájdených záznamov: 1  
Vaša požiadavka: Autor-kód záznamu = "^umb_un_auth 0228439^"
  1. NázovThe Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors
    Aut.údajeP. Horak, R. Nedela, A. Rosa
    Autor Horak P. (34%)
    Spoluautori Nedela Roman 1960- (33%) UMBFP12 - Inštitút matematiky a informatiky
    Rosa Alexander 1937- (33%)
    Zdroj.dok.Discrete mathematics. Vol. 284, no. 1-3 (2004), pp. 181-188. - Amsterdam : Elsevier Science BV, 2004
    Kľúč.slová matematika - mathematics   Hamiltonský cyklus   Hamiltonian cycle  
    Jazyk dok.angličtina
    KrajinaHolandsko
    Systematika 51
    AnotáciaWe 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.
    Kategória publikačnej činnosti ADE
    Číslo archívnej kópie28526
    Kategória ohlasu 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.
    Katal.org.BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici
    Báza dátxpca - PUBLIKAČNÁ ČINNOSŤ
    článok

    článok



  Tieto stránky využívajú súbory cookies, ktoré uľahčujú ich prezeranie. Ďalšie informácie o tom ako používame cookies.