Výsledky vyhľadávania
Názov Vrcholové ohodnotenia jednoduchých grafov Podnázov diplomová práca Aut.údaje Katarína Kotuľová; školiteľ: Miroslav Haviar Autor Kotuľová Katarína
Ďalší autori Haviar Miroslav 1965- (Školiteľ (konzultant))
Korp. Univerzita Mateja Bela . Fakulta prírodných vied . Katedra matematiky , Banská Bystrica, Slovensko Vyd.údaje Banská Bystrica , 2023. - 50 s. Kľúč.slová grafy - charts - graphs graciózne ohodnotenie grafov - graceful labelling of graphs grafové šachovnice - graph chessboards Form.deskr. diplomové práce - master’s theses Jazyk dok. angličtina Krajina Slovenská republika Systematika 517.18(084.21) Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xk - Kvalifikačné práce Počet ex. 1, z toho voľných 0 
kniha
Názov A survey on chessboard representations of classes of graceful graphs Aut.údaje Miroslav Haviar, Michal Ivaška Autor Haviar Miroslav 1965- (50%) UMBFP10 - Katedra matematiky
Spoluautori Ivaška Michal 1987- (50%)
Zdroj.dok. Acta Universitatis Matthiae Belii : series Mathematics, Vol. 29. Pp. 1-38. - Banská Bystrica : Vydavateľstvo Univerzity Mateja Bela - Belianum, 2021 Kľúč.slová grafy - charts - graphs graciózne ohodnotenie grafov - graceful labelling of graphs postupnosť Form.deskr. články - journal articles Jazyk dok. angličtina Krajina Slovenská republika Anotácia This is a survey on chessboard representations of classes of graceful graphs. We introduced and studied the concept of chessboard representations of graceful graphs in our book Vertex labellings of simple graphs in 2015, however, the book and hence its concepts and methods are not widely accessible. Our survey from the book is complemented by new applications of chessboard representations to the classes of k-enriched fan graphs presented by the first author and Kurtulík in 2021. The aim of the chessboard representations of classes of graceful graphs has been to provide an important value of visualization. Firstly, it leads to seeing better the pattern of the graceful labellings in already known graceful representations of simple graphs. Secondly, it can lead to creating new classes of graceful graphs as is demonstrated on the very recent example of the classes of k-enriched fan graphs. URL Link na plný text Kategória publikačnej činnosti AED Číslo archívnej kópie 51542 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ 
článok
Názov A new class of graceful graphs: k-enriched fan graphs and their characterisations Aut.údaje Miroslav Haviar, Samuel Kurtulík Autor Haviar Miroslav 1965- (50%) UMBFP10 - Katedra matematiky
Spoluautori Kurtulík Samuel (50%)
Zdroj.dok. Cubo : a mathematical journal. Vol. 23, č. 2 (2021), pp. 313-331. - Temuco : Department of mathematics and statistics of the Universidad de La Frontera, 2021 Kľúč.slová grafy - charts - graphs graciózne ohodnotenie grafov - graceful labelling of graphs grafové šachovnice - graph chessboards postupnosť Form.deskr. články - journal articles Jazyk dok. angličtina Krajina Chile Anotácia The Graceful Tree Conjecture stated by Rosa in the mid 1960s says that every tree can be gracefully labelled. It is one of the best known open problems in Graph Theory. The conjecture has caused a great interest in the study of gracefulness of simple graphs and has led to many new contributions to the list of graceful graphs. However, it has to be acknowledged that not much is known about the structure of graceful graphs after 55 years. Our paper adds an infinite family of classes of graceful graphs to the list of known simple graceful graphs. We introduce classes of k-enriched fan graphs kF_n for all integers k, n ≥ 2 and we prove that these graphs are graceful. Moreover, we provide characterizations of the k-enriched fan graphs kF_n among all simple graphs via Sheppard's labelling sequences introduced in the 1970s, as well as via labelling relations and graph chessboards. These last approaches are new tools for the study of graceful graphs introduced by Haviar and Ivaška in 2015. The labelling relations are closely related to Sheppard's labelling sequences while the graph chessboards provide a nice visualization of graceful labellings. We close our paper with an open problem concerning another infinite family of extended fan graphs. URL Link na zdrojový dokument Link na plný text Kategória publikačnej činnosti ADM Číslo archívnej kópie 50548 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 článok
Názov Graceful labellings of graphs Súbež.n. [Graciózne ohodnotenia grafov] Podnázov diplomová práca Aut.údaje Samuel Kurtulík; školiteľ: Miroslav Haviar Autor Kurtulík Samuel
Ďalší autori Haviar Miroslav 1965- (Školiteľ (konzultant))
Korp. Univerzita Mateja Bela . Fakulta prírodných vied . Katedra matematiky , Banská Bystrica, Slovensko Vyd.údaje Banská Bystrica , 2020. - 52 s. Kľúč.slová graciózne ohodnotenie grafov - graceful labelling of graphs grafy - charts - graphs Form.deskr. diplomové práce - master’s theses Jazyk dok. angličtina Krajina Slovenská republika Systematika 51 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xk - Kvalifikačné práce Počet ex. 1, z toho voľných 0, prezenčne 1 kniha
Názov Recent research on graceful labellings of simple graphs Súbež.n. [Nedávny výskum ohľadne gracióznych ohodnotení] Podnázov bakalárska práca Aut.údaje Katarína Kotuľová; školiteľ: Miroslav Haviar Autor Kotuľová Katarína
Ďalší autori Haviar Miroslav 1965- (Školiteľ (konzultant))
Korp. Univerzita Mateja Bela . Fakulta prírodných vied . Katedra matematiky , Banská Bystrica, Slovensko Vyd.údaje Banská Bystrica , 2020. - 59 s. Kľúč.slová grafy - charts - graphs graciózne ohodnotenie grafov - graceful labelling of graphs Form.deskr. bakalárske práce - bachelor’s theses Jazyk dok. angličtina Krajina Slovenská republika Systematika 51 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xk - Kvalifikačné práce Počet ex. 1, z toho voľných 0, prezenčne 1 kniha
Názov Graciózne ohodnotenia grafov vo vyučovaní matematiky Súbež.n. Graceful Labelings of Graphs in Mathematics Education Aut.údaje Pavel Klenovčan Autor Klenovčan Pavel 1950- (100%) UMBPF07 - Katedra elementárnej a predškolskej pedagogiky
Zdroj.dok. Tvořivost v počátečním vyučování matematiky : vědecká konference s mezinárodní účastí věnovaná matematickému vzdělávání v primární škole : sborník z konference. S. 110-114. - Plzeň : Západočeská univerzita v Plzni, 2011 / Pěchoučková Šárka ; Tvořivost v počátečním vyučování matematiky vědecká konference s mezinárodní účastí Poznámka Bibl.: s. 114 Kľúč.slová vyučovanie matematiky - teaching mathematics grafy - charts - graphs graciózne ohodnotenie grafov - graceful labelling of graphs mathematics education teória grafov - graph theory graceful labelings Jazyk dok. slovenčina Krajina Česká republika Systematika 51 Kategória publikačnej činnosti AFC Číslo archívnej kópie 18849 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ 
nerozpoznaný
Názov Vybrané problémy z teórie grafov Podnázov diplomová práca Aut.údaje Michal Ivaška; školiteľ: Miroslav Haviar Autor Ivaška Michal 1987-
Ďalší autori Haviar Miroslav 1965- (Školiteľ (konzultant))
Korp. Univerzita Mateja Bela . Fakulta prírodných vied . Katedra matematiky , Banská Bystrica, Slovensko Vyd.údaje Banská Bystrica , 2011. - 52 s. Kľúč.slová teória grafov - graph theory graciózne ohodnotenie grafov - graceful labelling of graphs grafy - charts - graphs Jazyk dok. slovenčina Krajina Slovenská republika Systematika 51 Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xk - Kvalifikačné práce Počet ex. 1, z toho voľných 0, prezenčne 1 kniha
Názov A new family of graceful trees Súbež.n. Nová trieda graciózne ohodnotených stromov Aut.údaje Pavel Hrnčiar, Gabriela Monoszová Autor Hrnčiar Pavel 1951- (60%) UMBFP10 - Katedra matematiky
Spoluautori Monoszová Gabriela 1955- (40%) UMBFP10 - Katedra matematiky
Zdroj.dok. Graphs 2007 Abstracts : Czech-Slovak Graph Theory Conference, Hradec nad Moravicí, June 11.-15. 2007. S. 19. - Ostrava : Technická univerzita, Vysoká škola báňská, 2007 Kľúč.slová matematika - mathematics množiny graciózne ohodnotenie grafov - graceful labelling of graphs zovšeobecnenie banánové stromy Jazyk dok. angličtina Krajina Česká republika Systematika 51 Kategória publikačnej činnosti AFG Číslo archívnej kópie 6477 Kategória ohlasu JESINTHA, J. Jeba - SETHURAMAN, G. All arbitrarily fixed generalized babana trees are graceful. In Mathematics in computer science. ISSN 1661-8289, 2011, vol. 5, no. 1, pp. 51-62.
ŠERMAN, Z. O. Kratkij obzor metodov konstrokciji gracefulnich grafov. In Vísnik Zaporížkogo nacíonaľnogo uníversitetu. Fíziko-matematiční nauki. ISSN 2413-6549, 2016, no. 1, pp. 284-297.
Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ článok
Názov All trees of diameter five are graceful Aut.údaje Pavel Hrnčiar, Alfonz Haviar Autor Hrnčiar Pavel 1951- (50%) UMBFP10 - Katedra matematiky
Spoluautori Haviar Alfonz (50%) UMBFP10 - Katedra matematiky
Zdroj.dok. Discrete mathematics. Vol. 233, no. 1-3 (2001), pp. 133-150. - : Elsevier Science B. V., 2001 Kľúč.slová matematika - mathematics algebra - algebra graciózne ohodnotenie grafov - graceful labelling of graphs Jazyk dok. angličtina Krajina Holandsko Systematika 512 Kategória publikačnej činnosti ADE Číslo archívnej kópie 21949 Kategória ohlasu JESINTHA, J. Jeba - SETHURAMAN, G. All arbitrarily fixed generalized babana trees are graceful. In Mathematics in Computer Science. ISSN 1661-8289, 2011, vol. 5, no. 1, pp. 51-62.
BRANKOVIC, L. - WANLESS, I. M. Graceful labelling : state of the art, applications and future directions. In Mathematics in computer science. ISSN 1661-8289, 2011, vol. 5, no. 1, pp. 11-20.
SETHURAMAN, G. - JESINTHA, J. J. A new class of graceful lobsters. In Journal of combinatorial mathematics and combinatorial computing. ISSN 0835-3026, 2008, vol. 67, pp. 99-109.
PANIGRAHI, P. Graceful labelling of some 3-distant trees. In Utilitas mathematica. ISSN 0315-3681, November 2010, vol. 83, pp. 81-93.
MISHRA, D. - PANIGRAHI, P. A new class of graceful lobsters obtained from diameter four trees. In Utilitas mathematica. ISSN 0315-3681, November 2009, vol. 80, pp. 183-209.
SETHURAMAN, G. - VENKATESH, S. Decomposition of complete graphs and complete bipartite graphs into α-labelled trees. In Ars combinatoria. ISSN 0381-7032, October 2009, vol. 93, no. 1, pp. 371-385.
EL-ZANATI, S. I. - EYNDEN, C. V. On Rosa-type labelings and cyclic graph decompositions. In Mathematica Slovaca. ISSN 0139-9918, 2009, vol. 59, no. 1, pp. 1-18.
CHAN, T. L. - CHEUNG, W. S. - NG, T. W. Graceful tree conjecture for infinite trees. In Electronic journal of combinatorics. ISSN 1077-8926, 2009, vol. 16, no. 1.
MISHRA, D. - PANIGRAHI, P. Some graceful lobsters with all three types of branches incident on the vertices of the central path. In Computers and mathematics with applications. ISSN 0898-1221, September 2008, vol. 56, no. 5, pp. 1382-1394.
PANIGRAHI, P. - MISHRA, D. Graceful lobsters obtained from diameter four trees using partitioning technique. In Ars combinatoria. ISSN 0381-7032, 2008, vol. 87, pp. 291-320.
MISHRA, D. - PANIGRAHI, P. Some graceful lobsters with both odd and even degree vertices on the central path. In Utilitas mathematica. ISSN 0315-3681, November 2007, vol. 74, pp. 155-177.
BALBUENA, C. - GARCÍA-VÁZQUEZ, P. - MARCOTE, X. - VALENZUELA, J. C. Trees having an even or quasi even degree sequence are graceful. In Applied mathematics letters. ISSN 0893-9659, April 2007, vol. 20, no. 4, pp. 370-375.
MISHRA, D. - PANIGRAHI, P. Graceful lobsters obtained by component moving of diameter four trees. In Ars combinatoria. ISSN 0381-7032, October 2006, vol. 81, pp. 129-146.
MISHRA, D. - PANIGRAHI, P. Graceful lobsters obtained by partitioning and component moving of branches of diameter four trees. In Computers and mathematics with applications. ISSN 0898-1221, August 2005, vol. 50, no. 3-4, pp. 367-380.
VENKATESAN, S. - SATTANATHAN, R. Some classes of graphs known to be graceful. In International journal of applied engineering research. ISSN 0973-4562, 2010, vol. 5, no. 10., pp. 1699-1705.
FRONCEK, Dalibor. Product rosy labeling of graphs. In Discussiones Mathematicae Graph Theory. ISSN 1234-3099, 2008, vol. 28, no. 3, pp. 431-439.
MISHRA, Debdas - PANIGRAHI, Pratima. Some new classes of graceful Lobsters obtained from diameter four trees. In Mathematica Bohemica. ISSN 0862-7959, 2010, vol. 135, no. 3, pp. 257-278.
PANIGRAHI, Pratima - MISHRA, Debdas. Graceful labeling of some classes of diameter six and diameter seven trees. In Icfai University Journal of Computational Mathematics. ISSN 0974-6544, December 2008, vol. 1, no. 3, pp. 7-16.
PANIGRAHI, Pratima - MISHRA, Debdas. Larger graceful and interlaced Lobsters obtained by joining smaller ones. In Southeast Asian Bulletin of Mathematics. ISSN 0129-2021, 2009, no. 33, pp. 509-525.
SETHURAMAN, G. - JESINTHA, J. Jeba. All banana trees are graceful. In Advances and Applications in Discrete Mathematics. ISSN 0974-1658, July 2009, vol. 4, no. 1, pp. 53-64.
SETHURAMAN, G. - JESINTHA, J. Jeba. Gracefulness of a family of rooted trees. In Far East Journal of Applied Mathematics. ISSN 0972-0960, February 2008, vol. 30, no. 2, pp. 143-159.
MISHRA, Debdas - PANDA, Amaresh Chandra - DASH, Rajani Ballav. A Class of ´n´ distant graceful trees. In Studies in Mathematical Sciences. ISSN 1923-8444, 2011, vol. 3, no. 2, pp. 21-27.
MISHRA, Debdas - PANIGRAHI, Pratima. Some new classes of graceful Lobsters obtained by applying inverse and component moving transformations. In International Journal of Mathematics Trends and Technology. ISSN 2231-5373, August 2011, vol. 2, no. 1, pp. 6-16.
JESINTHA, J. Jeba - SETHURAMAN, G. Generation of graceful trees. In International Journal of Algorithms, Computing and Mathematics. ISSN 0974-3367, November 2009, vol. 2, no. 4, pp. 33-38.
BRINKMANN, Gunnar - CREVALS, Simon - MELOT, Hadrien - RYLANDS, Leanne - STEFFEN, Eckhard. alpha-Labelings and the Structure of Trees with Nonzero alpha-Deficit. In Discrete mathematics and theoretical computer science. ISSN 1462-7264, 2012, vol. 14, no. 1, pp. 159.
ADAMS, Peter - BRYANT, Darryn - BUCHANAN, Melinda. A survey on the existence of G-designs. In Journal of combinatorial designs. ISSN 1063-8539, 2008, vol. 16, no. 5, pp. 373-410.
ROUT, Sushant Kumar - MISHRA, Debdas - BEHERA, Amiya Kumar. Some new transformation techniques with graceful labeling. In Global journal of mathematical sciences: theory and practical. ISSN 0974-3200, 2011, vol. 3, no. 4, pp. 333-346.
EDWARDS, Michelle - HOWARD, Lea. A survey of graceful trees. In Atlantic Electronic Journal of Mathematics. 2006, vol. 1, no. 1, pp. 5-30.
JESINTHA, J. Jeba - SETHURAMAN, G. A new class of graceful rooted trees. In Journal of discrete mathematical sciences and cryptography. ISSN 0972-0529, 2008, vol. 11, no. 4, pp. 421-435.
ALFALAYLEH, Mousa - BRANKOVIC, Ljiljana - GIGGINS, Helen - ISLAM, Md. Zahidul. Towards the graceful tree conjecture: a survey. In AWOCA 2004 : proceedings of the 15th Australasian workshop on combinatorial algotithms, Ballina (Australia), 7 - 9 July, 2004. Alexandria : NICTA, 2004. ISBN 186487628X, pp. [1-8].
BAČA, Martin - MILLER, Mirka. Super edge-antimagic graphs : a wealth of problems and some solutions. BrownWalker Press, 2008. 227 p. ISBN 978-1-59942-465-1.
DAI, Li - WANG, Zhenghua - XIE, Zheng. Another gracefull trees. In Journal of national university of defense technology. ISSN 1001-2486, 2008, vol. 30, no. 1, pp. 129-132.
GHOSH, Shamik. On certain classes of graceful lobsters. In ARS combinatoria. ISSN 0381-7032, 2018, vol. 136, pp. 67-96.
JANAKIRAMAN, T.N. Graceful labeling of different classes of lobsters connected in a path. In Applied mathematical sciences. ISSN 1312-885X, 2013, vol. 7, no. 80, pp. 3989-3994.
MISHRA, D. - PANDA, A.C. Some new graceful generalized classes of lobsters. In International journal of pure and applied mathematics. ISSN 1311-8080, 2014, vol. 91, no. 1, pp. 57-76.
MISHRA, Debdas - PANDA, Amaresh Chandra - DASH, Rajani Ballav. A class of diameter six trees with graceful labeling. In International journal of mathematical trends and technology [online]. 2014, vol. 9, no. 1 [cit. 2014-11-07]. ISSN 2231-5373. Dostupné na: http://www.ijmttjournal.org/archive/ijmtt-v9p508
JANAKIRAMAN, T. N. - SATHIAMOORTHY, G. Graceful labeling of a family of trees with very large diameter. In Journal of technolog-innovation [elektronický zdroj]. 2014, vol. 2, special issue 2, pp. 1-17.
FRONCEK, Dalibor. Recent advances in Rosa-type labelings of graphs. In Graphs and combinatorics. ISSN 0911-0119, 2009, vol. 6, no. 1, pp. 69-78.
GROSS, Johnathan, L. (ed). Handbook of graph theory. London : Champman and hall, 2013. 1630 p. ISBN 1439880182.
SUPERDOCK, Matt. New graceful diameter-6 trees by transfers. In arXiv: 1402.6570v1 [math.CO] [online]. New York : Cornell Univerisity Library, 2014 [cit. 201-11-11]. Dostupné na: http://arxiv.org/abs/1402.6570
YU, Wei - LIU, Er-gen. The gracefulness of graph Tk1(o)k3. In Journal of Ychun university. ISSN 1671-380X, 2013, vol. 35, no. 211 (6), pp. 10-11, 67.
SETHURAMAN, G. - RAGUKUMAR, P. Every tree is a subtree of graceful tree, graceful graph and Alpha-labeled graph. In Ars combinatoria. ISSN 0381-7032, 2017, vol. 132, pp. 27-47.
SETHURAMAN, G. - RAGUKUMAR, P. - SLATER, Peter J. Any tree with m edges can be embedded in a graceful tree with less than 4m edges and in a graceful planar graph. In Discrete mathematics. ISSN 0012-365X, 2017, vol. 340, no. 2, pp. 96-106.
MISHRA, Debdas - ROUT, Sushant Kumar - NAYAK, Purna Chandra. Some new graceful generalized classes of diameter six trees. In Electronic journal of graph theory and applications. ISSN 2338-2287, 2017, vol. 5, no. 1, pp. 94-111.
SETHURAMAN, G. - RAGUKUMAR, P. - SLATER, Peter J. Embedding an arbitrary tree in a graceful tree. In Bulletin of the Malaysian mathematical sciences society. ISSN 0126-6705, 2016, vol. 39, pp. S341-S360.
ANICK, David. Counting graceful labelings of trees : a theoretical and empirical study. In Discrete applied mathematics. ISSN 0166-218X, 2016, vol. 198, pp. 65-81.
PANDA, Amaresh Chandra - MISHRA, Debdas - DASH, Rajani Ballav. A class of diameter six trees exhibiting graceful labeling. In Journal of discrete mathematical sciences & cryptography. ISSN 0972-0529, 2016, vol. 19, no. 5-6, pp. 947-963.
CHAN, Tsz Lung - CHEUNG, Wai Shun - NG, Tuen Wai. Graceful labeling for mushroom trees. In Aequationes mathematicae. ISSN 0001-9054, 2015, vol. 89, no. 3, pp. 719-724.
WANG, Tao-Ming - YANG, Cheng-Chang - HSU, Lih-Hsing - CHENG, Eddie. Infinitely many equivalent versions of the graceful tree conjecture. In Applicable analysis and discrete mathematics. ISSN 1452-8630, 2015, vol. 9, no. 1, pp. 1-12.
PANDA, Amaresh Chandra - MISHRA, Debdas. Some new classes of graceful diameter six trees. In TWMS journal of applied and engineering mathematics. ISSN 2146-1147, 2015, vol. 5, no. 2, pp. 269-275.
GALLIAN, Joseph A. A dynamic survey of graph labeling. In Electronic journal of combinatorics. ISSN 1077-8926, 2014, no. DS6.
LAPIERRE, Luc - MCGUINNESS, Sean. Constructing trees with graceful labelings using caterpillars. In Journal of combinatorial mathematics and combinatorial computing. ISSN 0835-3026, 2015, vol. 94, pp. 313-321.
SETHURAMAN, G. - MURUGAN, V. Generating graceful trees from caterpillars by recursive attachment. In Electronic notes in discrete mathematics. ISSN 1571-0653, 2016, vol. 53, pp. 133-147.
JAMPACHON, P. - POOMSA-ARD, T. Graceful labeling of spider graphs with three legs of lengths greater than one. In Far east journal of mathematical sciences. ISSN 0972-0871, 2016, vol. 100, no. 1, pp. 51-64.
SANGSURA, K. - POOMSA-ARD, T. Graceful labelings of the classes of spider graphs with four legs of lengths greater than one sn (k, l, m, 2). In Far east journal of mathematical sciences. ISSN 0972-0871, 2016, vol. 100, no. 2, pp. 255-269.
PANPA, A. - POOMSA-ARD, T. On graceful spider graphs with at most four legs of lengths greater than one. In Journal of applied mathematics. ISSN 1110-757X, 2016, pp.
MISHRA, Debdas - BHATTACHARJEE, Subarna. Some new classes of lobsters exhibiting graceful labeling. In Global journal of pure and applied mathematics. ISSN 0973-1768, 2015, vol. 11, no. 2, pp. 909-930.
JAMPACHON, P. - NAKPRASIT, K. - POOMSA-ARD, T. Graceful labeling of some classes of spider graphs with three legs greater than one. In Thai journal of mathematics. ISSN 1686-0209, 2014, vol. 12, no. 3, pp. 621-630.
ŠERMAN, Z. O. Kratkij obzor metodov konstrokciji gracefulnich grafov. In Vísnik Zaporížkogo nacíonaľnogo uníversitetu. Fíziko-matematiční nauki. ISSN 2413-6549, 2016, no. 1, pp. 284-297.
LOPÉZ, C. Susana - MUNTANER-BATLE, Francesc A. Graceful, harmonious and magic type labelings relations and technigues. Cham : Springer International Publishing AG, 2017. ISBN 978-3-319-52656-0, pp. 65-90.
SHARMIN, Shouvari. Some precise ethos on graceful labeling trees. In International journal of engineering trends and technology. ISSN 2231-5381, 2016, vol. 42, no. 9.
PETRENIUK, D.A. Graceful trees : the state of atrs and the prospects. In USiM.ua [online], 2016, no. 1, pp. 16-21 [cit. 2017-10-16]. ISSN 2518-1262. Dostupné na: http://usim.irtc.org.ua/?page_id=377&lang=en
LUIZ, G. Atílio - CAMPOS, C.N. - RICHTER, R. Bruce. Some families of 0-rotatable graceful caterpillars. In 36 congresso da sociaedale Brasileira de computação [online]. 2016, pp. [812-815] [cit. 2017-10-16]. Dostupné na: http://www.ic.unicamp.br/~reltech/2017/17-12.pdf
PARVATHI, N. - VIDYANANDINI, S. Graceful labeling of a tree from caterpillars. In Journal of information and optimalization sciences. ISSN 0252-2667, 2014, vol. 35, no. 4, pp. [1-3].
MISHRA, Debdas - PANDA, Amaresh Chandra. Seome new family of graceful lobsters. In Advances and applications in discrete mathematics. ISSN 0974-1658, 2014, vol. 14, no. 1, pp. 1-24.
JESINTHA, J. Jeba - SETHURAMAN, G. A new family graceful rooted trees. In The mathematics student. ISSN 0025-5742, 2009, vol. 78, no. 1-4, pp. 163-170.
HAVIAR, Miroslav - IVAŠKA, Michal. Vertex labellings of simple graphs : research and exposition in mathematics, vol. 34. Lemgo : Heldermann Verlag, 2015. [153] p. ISBN 978-3-88538-234-8.
SETHURAMAN, G. - RAGUKUMAR, P. Construction of an alpha-labeled tree from a given set of alpha-labeled trees. In International journal of graphs and combinatorics. ISSN 0972-8600, 2017, vol. 14, no. 2, pp. 118-129.
MULAIKAH - BUDAYASA, Ketut. Dekomposisi bintang linier graph lobster. In Mathunesa [online]. 2014, vol. 3, no. 3, pp. 87-92 [cit. 2019-01-25]. ISSN 2301-9115. Dostupné na: http://jurnalmahasiswa.unesa.ac.id/index.php/mathunesa/article/view/9368
JESINTHA, J. Jeba - SUBASHINI, K. On gracefulness of vertex switching of even cycles. In International journal of pure and applied mathematics [online]. 206, vol. 109, no. 10, pp. 11-18 [cit. 2018-01-25]. ISSN 1314-3395. Dostupné na: https://acadpubl.eu/jsi/2016-109-si/10/2.pdf
MISHRA, Debdas - PANDA, Amaresh Chandra. A family of graceful diameter six trees generated by component moving techniques. In British journal of mathematics & computer science [online]. 2017, vol. 21, no. 1, pp. 1-15 [cit. 2019-01-25]. ISSN 2231-0851. Dostupné na: http://www.journalrepository.org/media/journals/BJMCS_6/2017/Mar/Mishra2112016BJMCS31074_1.pdf
MISHRA, Debdas - ROUT KUMA, Sushantut - NAYAK, Purna Chandra. Some new graceful generalized classes of lobsters with pendant vertices with central paths. In Indian journal of science & technology [online]. 2017, vol. 10, no. 6, pp. [1-9][cit. 2019-01-25]. ISSN 0974-5645. Dostupné na: http://www.indjst.org/index.php/indjst/article/viewFile/86164/78296
MISHRA, Debdas - KUMAR, BEHERA, Amiya Kumar - NAYAK, Purna Chandra. Some graceful three distant trees by component moving operation. In International journal of applied and computational mathematics [online]. 2016, vol. 3, no. 2, pp. 1-8. [cit. 2019-01-25]. ISSN 2199-5796. Dostupné na: https://link.springer.com/article/10.1007/s40819-016-0169-4
SATHIAMOORTHY, G. - JANAKIRAMAN, T. N. - AYYASWAMY, S.K. Graceful labeling of generalized dendrimers connected by a path Pn. In International journal of pure and applied mathematics. ISSN 1311-8080, 2018, vol. 119, no. 10, pp. 1417-1446.
CAHIT, I. Graceful labeling of the rooted complete trees. In Mathematics preprint archive SSRN [online]. 2002, no. 8, pp. 145-159 [cit. 2019-03-04]. Dostupné na: https://ssrn.com/abstract=3137730
Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ nerozpoznaný
Názov All trees of diameter five are graceful Aut.údaje Alfonz Haviar, Pavel Hrnčiar Autor Haviar Alfonz UMBFP10 - Katedra matematiky
Spoluautori Hrnčiar Pavel 1951- UMBFP10 - Katedra matematiky
Zdroj.dok. Fifth Czech - Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications : Abstracts. S. 48. - Praha : Karlova univerzita, 1998 Kľúč.slová matematika - mathematics grafy - charts - graphs stromy - trees graciózne ohodnotenie grafov - graceful labelling of graphs Systematika 519.1 Kategória publikačnej činnosti AFG Katal.org. BB301 - Univerzitná knižnica Univerzity Mateja Bela v Banskej Bystrici Báza dát xpca - PUBLIKAČNÁ ČINNOSŤ nerozpoznaný