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

    Some contributions from graph theory to the design and study of large and fault-tolerant interconnection networks 

    Pelayo Melero, Ignacio Manuel (Date of defense: 2000-03-13)

    Esta tesis trata diversas cuestiones relacionadas con el diseño y estudio de redes de interconexión densas y fiables. Concretamente en ella se han incluido cuatro grupos de contribuciones. En primer lugar se presenta una ...