• Graph polynomials and group coloring of graphs 

      Bosek, Bartlomiej; Grytczuk, Jaroslaw; Gutowski, Grzegorz; Serra Albó, Oriol; Zajac, Mariusz (2022-05-01)
      Article
      Accés obert
      Let A be an Abelian group and let G be a simple graph. We say that G is A-colorable if, for some fixed orientation of G and every edge labeling l:E(G)¿A, there exists a vertex coloring c by the elements of A such that ...
    • On the smallest trees with the same restricted U-polynomial and the rooted U-polynomial 

      Aliste Prieto, José; Mier Vinué, Anna de; Zamora Ponce, José (2021-03-01)
      Article
      Accés obert
      In this article, we construct explicit examples of pairs of non-isomorphic trees with the same restricted U -polynomial for every k; by this we mean that the polynomials agree on terms with degree at most k + 1. The main ...
    • On trees with the same restricted U-polynomial and the Prouhet–Tarry–Escott problem 

      Aliste Prieto, José; Mier Vinué, Anna de; Zamora, José (2017-06)
      Article
      Accés obert
      This paper focuses on the well-known problem due to Stanley of whether two non-isomorphic trees can have the same U-polynomial (or, equivalently, the same chromatic symmetric function). We consider the Uk-polynomial, which ...
    • Polynomials for marked graphs and the chromatic symmetric function 

      Aliste Prieto, José; Mier Vinué, Anna de; Orellana, Rosa; Zamora, José (Universidad de Cantabria, 2022)
      Comunicació de congrés
      Accés restringit per política de l'editorial