Number of the records: 1  

Almost all trees are almost graceful

  1. 1.
    SYSNO0524449
    TitleAlmost all trees are almost graceful
    Author(s) Adamaszek, A. (DK)
    Allen, P. (GB)
    Grosu, C. (CH)
    Hladký, Jan (MU-W) RID, SAI, ORCID
    Corespondence/seniorHladký, Jan - Korespondující autor
    Source Title Random Structures and Algorithms. Roč. 56, č. 4 (2020), s. 948-987. - : Wiley
    Document TypeČlánek v odborném periodiku
    Grant 628974, XE - EU countries
    Institutional supportMU-W - RVO:67985840
    Languageeng
    CountryUS
    Keywords extremal graph theory * graceful tree labelling * tree
    Cooperating institutions London School of Economics (United Kingdom)
    Google (Switzerland)
    SimCorp (Denmark)
    URLhttps://doi.org/10.1002/rsa.20906
    Permanent Linkhttp://hdl.handle.net/11104/0308811
    FileDownloadSizeCommentaryVersionAccess
    Hladky.pdf1992.7 KBPublisher’s postprintrequire
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.