INFORMACION

  Gelasio Salazar

Publications

• Random perturbations of iterated maps (with J. Urias), Journal of Mathematical Physics 37 (1996), no. 7, 3641-3643.
 
• Traveling patterns in cellular automata (with A. Enciso, E. Ugalde and J. Urias), Chaos 6 (1996), no. 3, 493-503.
 
• Internal symmetries of cellular automata via their polynomial representation (with J. Urias), Chaos 8 (1998), no. 3, 711-716.
 
• Synchronization of cellular automaton pairs (with E. Ugalde and J. Urias), Chaos 8 (1998), no. 4, 814-818.
 
• A cryptosystem based on cellular automata (with E. Ugalde and J. Urias), Chaos 8 (1998), no. 4, 819-822.
 
• On the Crossing Number of C_m X C_n , Journal of Graph Theory 28 (1998), no. 3, 163-170.
 
• On the Intersections of Systems of Curves, Journal of Combinatorial Theory Series B, 75 (1999), no. 1, 56-60.
 
• Drawings of C_m X C_n with one disjoint family, Journal of Combinatorial Theory Series B, 76 (1999), no. 2, 129-135.
 
• On a crossing number result of Richter and Thomassen, Journal of Combinatorial Theory, Series B, 79 (2000), no. 1, 98-99.
 
• A lower bound for the Crossing Number of C _m X C_n, Journal of Graph Theory 35 (2000), 222-226.
 
• Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree (with E. Garcia-Moreno), Journal of Graph Theory 36 (2001), no. 3, 168-173.
 
• Drawings of C_m X C_n with one disjoint family II , Journal of Combinatorial Theory, Series B,  82 (2001), no. 1, 161-165.
 
• The Crossing Number of C₆ X C _n (with Bruce Richter), Australasian Journal of Combinatorics 23 (2001), 135-144.
 
• The Crossing Number of P(N,3) (with Bruce Richter), Graphs and Combinatorics 18 (2002), no. 2, 381-394.
 
• Infinite families of crossing-critical graphs with given average degree, Discrete Mathematics, 271 (2003), no. 1-3, 343-350.
 
• Optimal meshes of curves in the Klein bottle (with Hector A. Juarez), Journal of Combinatorial Theory, Series B 88 (2003), no. 1, 185-188.
   
• Small meshes of curves and their role in the analysis of optimal meshes , Discrete Mathematics 263 (2003), no. 1-3, 233-246.
 
• Morelia test: improving the efficiency of the Gabriel test and face routing in ad-hoc networks. Structural information and communication complexity (with P. Boone, E. Chavez, L. Glebsky, E. Kranakis, J. Opatrny, and J. Urrutia), Lecture Notes in Computer Science 3104, Springer-Verlag, Berlin, (2004), 23-34.
 
• The crossing number of C_m X C _n is as conjectured for n ≥ m(m+1) (with Lev Glebsky), Journal of Graph Theory 47 (2004), no. 1, 53--72.
 
• Embedding grids in surfaces (with Jim Geelen and Bruce Richter), European Journal of Combinatorics 25 (2004), no. 6, 785--792.
 
• An improved bound for the crossing number of cr(C_m X C _n) : a self-contained proof using mostly combinatorial arguments (with E. Ugalde), Graphs and Combinatorics, 20 (2004), no. 2, 247--253.
 
• Spanning trees of multicoloured point sets with few intersections (with J. Leanos, C. Merino, and J. Urrutia), Lecture Notes in Computer Science 3330 , Springer-Verlag, Berlin, (2005), 113-122.
 
• On the crossing numbers of loop networks and Generalized Petersen Graphs , Discrete Mathematics 302 (2005), no. 1-3, 243--253.
 
• On the Intersection number of matchings and minimum weight perfect matchings of multicolored point sets (with C. Merino and J. Urrutia). Graphs and Combinatorics 21 (2005), 333-341.
 
• Master-slave synchronization of affine cellular automaton pairs (with E. Ugalde and J. Urias), Discrete and Continuous Dynamical Systems 13 (2005), no. 2, 491--502.
 
• On the length of the longest alternating paths for multicoloured point sets in convex position (with C. Merino and J. Urrutia). Discrete Mathematics, to appear.
 
• Two maps with large representativity on one surface (with B. Richter), Journal of Graph Theory 50, no. 3, 234-245.
 
• Nearly-light cycles in embedded graphs and crossing-critical graphs , (with M. Lomeli), Journal of Graph Theory, to appear. In this paper, Theorem 6 is stated without proof. A referee for this paper asked that we write a proof of Theorem 6, and suggested that we posted it in this web page. The result is "Addendum to `Nearly-light cycles in embedded graphs and crossing-critical graphs'".
 
• Improved bounds for the crossing numbers of of K_m,n and K_n (with E. de Klerk, J. Maharry, D.V. Pasechnik, and R.B. Richter). SIAM Journal on Discrete Mathematics, to appear.
 
• On k-sets, convex quadrilaterals, and the rectilinear crossing number of K_n (with Jozsef Balogh). Discrete and Computational Geometry, to appear.
 
• Large harmonious sets of non-crossing edges for n randomly labeled vertices in convex position (with Jozsef Balogh and Boris Pittel), submitted.
 
• Simple Euclidean arrangements with no ( ≥ 5) -gons are stretchable (with J. Leanos, C. Merino, and J. Urrutia), submitted.
 
• A note on harmonic subgraphs in labelled geometric graphs (with G. Araujo, J. Balogh, R. Fabila, and J. Urrutia), submitted.
 
• On the additivity of crossing numbers of graphs (with J. Leanos), submitted.
 
• The convex hull of every optimal pseudolinear drawing of K_n is a triangle (with J. Balogh, J. Leanos, S. Pan, and R.B. Richter), submitted.
 
• On k-pseudoedges in generalized configurations and the pseudolinear crossing number of K_n (with B. Ábrego, J. Balogh, S. Fernández--Merchant, and J. Leaños), submittedd.
 
• An extended lower bound on the number of to generalized configurations of points and the pseudolinear crossing number of K_n (with B. Ábrego, J. Balogh, S. Fernández--Merchant, and J. Leaños), submitted.

Students Supervision

• Héctor Juárez  (B.Sc., 1998)


• Eduardo Calvillo  (B.Sc., 1999)


• Mario Lomelí  (B.Sc., 2001)


• Leticia Ramírez (B.Sc. Project, 2001)
  


• Jetzabel Hernández  (B.Sc., 2001)


• Jesús Leaños  (B.Sc. Project, 2002)


• Adrián Cerda (B.Ss., 2003)


• Héctor Juárez  (M.Sc., 2000)


• Alfonso Alba  (M.Sc., 2001)


• Mario Lomelí  (M.Sc., 2003)


• Jesús Leaños  (M.Sc., 2003)


• Héctor Juárez  (Ph.D., 2004)


• Mario Cetina  (M.Sc., 2005)


• Jesús Leaños  (Ph.D., in progress)


• Mario Cetina (Ph.D., in progress)

Last modified:   November 1, 2006