UP - logo

Search results

Basic search    Advanced search   
Search
request
Library

Currently you are NOT authorised to access e-resources UPUK. For full access, REGISTER.

29 30 31
hits: 303
301.
  • On the graph labellings ari... On the graph labellings arising from phylogenetics
    Buczyńska, Weronika; Buczyński, Jarosław; Kubjas, Kaie ... Central European journal of mathematics, 09/2013, Volume: 11, Issue: 9
    Journal Article
    Peer reviewed
    Open access

    We study semigroups of labellings associated to a graph. These generalise the Jukes-Cantor model and phylogenetic toric varieties defined in Buczynska W., Phylogenetic toric varieties on graphs, J. ...
Full text

PDF
302.
  • On the Complexity of Gap-[2... On the Complexity of Gap-[2]-vertex-labellings of Subcubic Bipartite Graphs
    Weffort-Santos, C.A.; Campos, C.N.; Schouery, R.C.S. Electronic notes in theoretical computer science, 08/2019, Volume: 346
    Journal Article
    Open access

    A gap-k-vertex-labelling of a simple graph G = (V, E) is a pair (π, cπ) in which π : V (G) → {1, 2, ..., k} is an assignment of labels to the vertices of G and cπ : V (G) → {0, 1, ..., k} is a proper ...
Full text

PDF
303.
  • Graceful Labelling: State o... Graceful Labelling: State of the Art, Applications and Future Directions
    Brankovic, Ljiljana; Wanless, Ian M. Mathematics in computer science, 03/2011, Volume: 5, Issue: 1
    Journal Article
    Peer reviewed

    This paper takes a close look at graceful labelling and its applications. We pay special attention to the famous Graceful Tree Conjecture, which has attracted a lot of interest and engaged many ...
Full text

Load filters