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

Vilaltella Castanyer, Joan, 1969- (Date of defense: 2015-07-14)

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 ...