2008 |
17 | EE | Geoffrey Exoo,
Tero Laihonen,
Sanna M. Ranto:
New bounds on binary identifying codes.
Discrete Applied Mathematics 156(12): 2250-2263 (2008) |
2007 |
16 | EE | 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 |
15 | EE | Geoffrey Exoo:
epsilon-Unit Distance Graphs.
Discrete & Computational Geometry 33(1): 117-123 (2005) |
2004 |
14 | EE | Xu Xiaodong,
Xie Zheng,
Geoffrey Exoo,
Stanislaw P. Radziszowski:
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers.
Electr. J. Comb. 11(1): (2004) |
13 | EE | Geoffrey Exoo:
Voltage Graphs, Group Presentations and Cages.
Electr. J. Comb. 11(1): (2004) |
2003 |
12 | EE | Geoffrey Exoo:
A Euclidean Ramsey Problem.
Discrete & Computational Geometry 29(2): 223-227 (2003) |
2002 |
11 | EE | 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) |
10 | EE | Geoffrey Exoo:
A Small Trivalent Graph of Girth 14.
Electr. J. Comb. 9(1): (2002) |
1998 |
9 | EE | Geoffrey Exoo:
Some New Ramsey Colorings.
Electr. J. Comb. 5: (1998) |
1996 |
8 | EE | Geoffrey Exoo:
A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16.
Electr. J. Comb. 3(1): (1996) |
1994 |
7 | EE | Geoffrey Exoo:
A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers.
Electr. J. Comb. 1: (1994) |
1991 |
6 | EE | Geoffrey Exoo:
Three color Ramsey number of K4-e.
Discrete Mathematics 89(3): 301-305 (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 | EE | Geoffrey Exoo,
Donald F. Reynolds:
Ramsey numbers based on C5-decompositions.
Discrete Mathematics 71(2): 119-127 (1988) |
1983 |
3 | EE | Geoffrey Exoo:
On line disjoint paths of bounded length.
Discrete Mathematics 44(3): 317-318 (1983) |
1982 |
2 | EE | 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 | EE | 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) |