FELIÚ D. SAGOLS TRONCOSO

Combinatoris, Graph Theory and Computer Science

Home

Industry and applied work

Department of Mathematics

CINVESTAV

Research:

  • F. Sagols, J. Mu\~noz, C. J. Colbourn. Ideals, Varieties, Colorings and Combinatorial Designs Submited to Beitraege zur Algebra und Geometrie. PDF

  • F. Sagols, J. Navarro, M. Ulloa, E. Hernández y M. López. Sistema Integral para construir y explotar bases de datos geográficas vía Internet. Computación y Sistemas 11 No.2 (2008). PDF

  • I. Gitler, F. Sagols. On terminal delta-wye reducibility of planar graphs. Journal of Graphs and Combinatorics (Submited) PDF

  • F. Sagols, L. P. Riccio, C. J. Colbourn. Dominated Error Correcting Codes with Distance Two. Journal of Combinatorial Designs 10 No. 5 (2002), 294--302. PDF

  • D. Archdeacon, F. Sagols. Nesting points in the sphere. Discrete Mathematics No. 244 (2002), 5--16. PDF

  • F. Sagols, C. J. Colbourn. NS1D0 Sequences and Anti-Pasch Steiner Triple Systems. Ars Combinatoria LXII (2001), 17--31. PDF

  • C. J. Colbourn, F. Sagols. Triangulations and a Generalization of Bose's Method. Discrete Mathematics No. 237 (2001), 97--107. PDF

  • F. Sagols. Hamiltonian Representation of Vox-Solids. Computacón y Sistemas 4 No. 2 (1999),213--217.PDF

  • Dissemination of Science:

  • F. Sagols. Teoría de la computación: El arte de descifrar el corazón de las maquinas. La tecnología y la ciencia desde el Cinvestav Capítulo 1. CINVESTAV (2006). PDF

  • F. Sagols. Las matemáticas en Enciclomedia. CINVESTAV 11 (2006), 11--17. PDF