Search the dblp DataBase
J. Gómez :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
J. Gómez , M. Escudero Edge-Colorings of Some Large Graphs on Alphabets. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:49, n:, pp:- [Journal ] Ignacio M. Pelayo , Camino Balbuena , J. Gómez On the connectivity of generalized p-cycles. [Citation Graph (0, 0)][DBLP ] Ars Comb., 2001, v:58, n:, pp:- [Journal ] J. Gómez , Ignacio M. Pelayo , Camino Balbuena Diameter vulnerability of GC graphs. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:130, n:3, pp:395-416 [Journal ] Camino Balbuena , Ignacio M. Pelayo , J. Gómez On the superconnectivity of generalized p -cycles. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:255, n:1-3, pp:13-23 [Journal ] Charles Delorme , J. Gómez Some New Large Compound Graphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2002, v:23, n:5, pp:539-547 [Journal ] J. Gómez , M. Escudero Optimal edge coloring of large graphs. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:1, pp:61-65 [Journal ] J. Gómez , Ignacio M. Pelayo , Camino Balbuena New large graphs with given degree and diameter six. [Citation Graph (0, 0)][DBLP ] Networks, 1999, v:34, n:2, pp:154-161 [Journal ] Consolación Gil , Raul Baños , Maria Dolores Gil Montoya , J. Gómez Performance of Simulated Annealing, Tabu Search, and Evolutionary Algorithms for Multi-objective Network Partitioning. [Citation Graph (0, 0)][DBLP ] Algorithmic Operations Research, 2006, v:1, n:1, pp:- [Journal ] J. Gómez , Miguel Angel Fiol , Oriol Serra On large (Delta, D)-graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:114, n:1-3, pp:219-235 [Journal ] J. Gómez Solution of the conjecture: If n=0(mod 4), n>4, then K_{n} has a super vertex-magic total labeling. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2007, v:307, n:21, pp:2525-2534 [Journal ] Design of a Snort-Based Hybrid Intrusion Detection System. [Citation Graph (, )][DBLP ] Two new methods to obtain super vertex-magic total labelings of graphs. [Citation Graph (, )][DBLP ] On large vertex-symmetric digraphs. [Citation Graph (, )][DBLP ] Search in 0.003secs, Finished in 0.003secs