B. Sc. Thesis

José Pérez Marín, " Algoritmic problems on distance in graphs", Trabajo de curso, Universidad de La Habana, Facultad de Matemática, 1984 (in spanish). (2.5Mb)

Rita López and José Pérez Marín, " Some algoritmic problems of Combinatorial Theory", B. Sc. Thesis, Universidad de La Habana, Facultad de Matemática, 1985 (in spanish). (3.9Mb)

Ana Calviño, "Generación de objetos combinatorios elementales", B. Sc. Thesis, Universidad de La Habana, Facultad de Matemática,1989 (in spanish). (7.11Mb)

Herbert Pérez, " On partitions of the complete bipartite graph", B. Sc. Thesis, Universidad de La Habana, Facultad de Matemática, 1991 (in spanish). (4.1Mb)

Luis Blackaller, " An infinite family of regular polyhedra", B. Sc. Thesis, UNAM, Facultad de Ciencias, 1997 (in spanish). (4.7Mb)

 

M. Sc. Thesis

Joaquin Tey, " Minimal tight 3-graphs: The case 3 mod 6", M. Sc. Thesis, UNAM, Facultad de Ciencias, 1997 (in spanish). (0.5Mb)

Pilar Valencia, " The heterochromaticic number of surface triangulations", M. Sc. Thesis, UNAM, Facultad de Ciencias, 1998 (in spanish). (0.8Mb)

 

Ph. D. Thesis

Bernardo Llano, "Tight and untight equations". Ph. D. Thesis, UNAM, Facultad de Ciencias, 1998 (in spanish). (5.25Mb)

Joaquin Tey, " The size of minimum 3-trees", Ph. D. Thesis, UNAM, Facultad de Ciencias, 2000 (in spanish). (0.7Mb)


Last Update: Lunes, 28 de Enero de 2002.