• Contribucions a la teoria de l'aresta-acoloriment de grafs : snarks i multipols 

      Vilaltella Castanyer, Joan (Universitat Politècnica de Catalunya, 2015-07-14)
      Tesi
      Accés obert
      A graph where every vertex has three neighboring vertices is a cubic graph. An edge-coloring is an assignment of colors to the edges of a graph in such a way that the edges incident to a vertex have no repeated colors. An ...
    • Some results on the structure of multipoles in the study of snarks 

      Fiol Mora, Miquel Àngel; Vilaltella Castanyer, Joan (2015-02-25)
      Article
      Accés obert
      Multipoles are the pieces we obtain by cutting some edges of a cubic graph in one or more points. As a result of the cut, a multipole M has vertices attached to a dangling edge with one free end, and isolated edges with ...