 | 2012 |
| 28 |  | Geoffrey Exoo,
Joan Gimbert,
Nacho López,
José Gómez:
Radial Moore graphs of radius three.
Discrete Applied Mathematics 160(10-11): 1507-1512 (2012) |
| 2011 |
| 27 |  | Geoffrey Exoo,
Ville Junnila,
Tero Laihonen:
Locating-dominating codes in paths.
Discrete Mathematics 311(17): 1863-1873 (2011) |
| 26 |  | Geoffrey Exoo,
Robert Jajcay:
On the girth of voltage graph lifts.
Eur. J. Comb. 32(4): 554-562 (2011) |
| 25 |  | Geoffrey Exoo,
Brendan D. McKay,
Wendy J. Myrvold,
Jacqueline Nadon:
Computational determination of (3, 11) and (4, 7) cages.
J. Discrete Algorithms 9(2): 166-169 (2011) |
| 2010 |
| 24 |  | Geoffrey Exoo,
Ville Junnila,
Tero Laihonen,
Sanna M. Ranto:
Improved bounds on identifying codes in binary Hamming spaces.
Eur. J. Comb. 31(3): 813-827 (2010) |
| 23 |  | Marston D. E. Conder,
Geoffrey Exoo,
Robert Jajcay:
On the limitations of the use of solvable groups in Cayley graph cage constructions.
Eur. J. Comb. 31(7): 1819-1828 (2010) |
| 22 |  | Carles Capdevila,
Josep Conde,
Geoffrey Exoo,
Joan Gimbert,
Nacho López:
Ranking measures for radially Moore graphs.
Networks 56(4): 255-262 (2010) |
| 2009 |
| 21 |  | Robert Jajcay,
Geoffrey Exoo:
Properties of Groups for the Cage and Degree/Diameter Problems.
Electronic Notes in Discrete Mathematics 34: 341-345 (2009) |
| 2008 |
| 20 |  | Geoffrey Exoo,
Ville Junnila,
Tero Laihonen,
Sanna M. Ranto:
Improved bounds on binary identifying codes.
ISIT 2008: 629-633 |
| 19 |  | Geoffrey Exoo,
Tero Laihonen,
Sanna M. Ranto:
New bounds on binary identifying codes.
Discrete Applied Mathematics 156(12): 2250-2263 (2008) |
| 2007 |
| 18 |  | Geoffrey Exoo,
Tero Laihonen,
Sanna M. Ranto:
Improved Upper Bounds on Binary Identifying Codes.
IEEE Transactions on Information Theory 53(11): 4255-4260 (2007) |
| 2005 |
| 17 |  | Geoffrey Exoo:
epsilon-Unit Distance Graphs.
Discrete & Computational Geometry 33(1): 117-123 (2005) |
| 2004 |
| 16 |  | Xiaodong Xu,
Xie Zheng,
Geoffrey Exoo,
Stanislaw P. Radziszowski:
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers.
Electr. J. Comb. 11(1): (2004) |
| 15 |  | Geoffrey Exoo:
Voltage Graphs, Group Presentations and Cages.
Electr. J. Comb. 11(1): (2004) |
| 2003 |
| 14 |  | Geoffrey Exoo:
A Euclidean Ramsey Problem.
Discrete & Computational Geometry 29(2): 223-227 (2003) |
| 2002 |
| 13 |  | Geoffrey Exoo,
Alan C. H. Ling,
John P. McSorley,
Nicholas C. K. Phillips,
Walter D. Wallis:
Totally magic graphs.
Discrete Mathematics 254(1-3): 103-113 (2002) |
| 12 |  | Geoffrey Exoo:
A Small Trivalent Graph of Girth 14.
Electr. J. Comb. 9(1): (2002) |
| 1998 |
| 11 |  | Geoffrey Exoo:
Some New Ramsey Colorings.
Electr. J. Comb. 5: (1998) |
| 1996 |
| 10 |  | Geoffrey Exoo:
A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16.
Electr. J. Comb. 3(1): (1996) |
| 1994 |
| 9 |  | Geoffrey Exoo:
A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers.
Electr. J. Comb. 1: (1994) |
| 1992 |
| 8 |  | H. L. Abbott,
Geoffrey Exoo:
On set systems not containing delta systems.
Graphs and Combinatorics 8(1): 1-9 (1992) |
| 1991 |
| 7 |  | Geoffrey Exoo:
Three color Ramsey number of K4-e.
Discrete Mathematics 89(3): 301-305 (1991) |
| 6 |  | Geoffrey Exoo:
A bipartite Ramsey number.
Graphs and Combinatorics 7(4): 395-396 (1991) |
| 1989 |
| 5 |  | Geoffrey Exoo:
On Two Classical Ramsey Numbers of the Form R(3, n).
SIAM J. Discrete Math. 2(4): 488-490 (1989) |
| 1988 |
| 4 |  | Geoffrey Exoo,
Donald F. Reynolds:
Ramsey numbers based on C5-decompositions.
Discrete Mathematics 71(2): 119-127 (1988) |
| 1983 |
| 3 |  | Geoffrey Exoo:
On line disjoint paths of bounded length.
Discrete Mathematics 44(3): 317-318 (1983) |
| 1982 |
| 2 |  | Takao Asano,
Nobuji Saito,
Geoffrey Exoo,
Frank Harary:
The smallest 2-connected cubic bipartite planar nonhamiltonian graph.
Discrete Mathematics 38(1): 1-6 (1982) |
| 1981 |
| 1 |  | Jin Akiyama,
Hiroshi Era,
Geoffrey Exoo:
Further results on graph equations for line graphs and n-th power graphs.
Discrete Mathematics 34(3): 209-218 (1981) |