The smallest graphs with certain adjacency properties. - Geoffrey Exoo; Frank Harary (Discret. Math., 1980)

Further results on graph equations for line graphs and n-th power graphs. - Jin Akiyama; Hiroshi Era; Geoffrey Exoo (Discret. Math., 1981)

Paley graphs satisfy all first-order adjacency axioms. - Andreas Blass; Geoffrey Exoo; Frank Harary (J. Graph Theory, 1981)

On an adjacency property of graphs. - Geoffrey Exoo (J. Graph Theory, 1981)

Covering and packing in graphs IV: Linear arboricity. - Jin Akiyama; Geoffrey Exoo; Frank Harary (Networks, 1981)

The smallest 2-connected cubic bipartite planar nonhamiltonian graph. - Takao Asano; Nobuji Saito; Geoffrey Exoo; Frank Harary (Discret. Math., 1982)

A counterexample to a conjecture on paths of bounded length. - Stephanie M. Boyles; Geoffrey Exoo (J. Graph Theory, 1982)

On a measure of communication network vulnerability. - Geoffrey Exoo (Networks, 1982)

On line disjoint paths of bounded length. - Geoffrey Exoo (Discret. Math., 1983)

Ramsey numbers based on C5-decompositions. - Geoffrey Exoo; Donald F. Reynolds (Discret. Math., 1988)

The ramsey number of k5 - e. - C. R. J. Clapham; Geoffrey Exoo; Heiko Harborth; Ingrid Mengersen; J. Sheehan (J. Graph Theory, 1989)

A lower bound for r(5, 5). - Geoffrey Exoo (J. Graph Theory, 1989)

On Two Classical Ramsey Numbers of the Form R(3, n). - Geoffrey Exoo (SIAM J. Discret. Math., 1989)

Three color Ramsey number of K4-e. - Geoffrey Exoo (Discret. Math., 1991)

A bipartite Ramsey number. - Geoffrey Exoo (Graphs Comb., 1991)

On set systems not containing delta systems. - H. L. Abbott; Geoffrey Exoo (Graphs Comb., 1992)

A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers. - Geoffrey Exoo (Electron. J. Comb., 1994)

A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16. - Geoffrey Exoo (Electron. J. Comb., 1996)

Some New Ramsey Colorings. - Geoffrey Exoo (Electron. J. Comb., 1998)

A trivalent graph of girth 17. - Geoffrey Exoo (Australas. J Comb., 2001)

A family of graphs and the degree/diameter problem. - Geoffrey Exoo (J. Graph Theory, 2001)

A Small Trivalent Graph of Girth 14. - Geoffrey Exoo (Electron. J. Comb., 2002)

Totally magic graphs. - Geoffrey Exoo; Alan C. H. Ling; John P. McSorley; Nicholas C. K. Phillips; Walter D. Wallis (Discret. Math., 2002)

A Euclidean Ramsey Problem. - Geoffrey Exoo (Discret. Comput. Geom., 2003)

Voltage Graphs, Group Presentations and Cages. - Geoffrey Exoo (Electron. J. Comb., 2004)

Constructive Lower Bounds on Classical Multicolor Ramsey Numbers. - Xiaodong Xu 006; Xie Zheng; Geoffrey Exoo; Stanislaw P. Radziszowski (Electron. J. Comb., 2004)

Some applications of pq-groups in graph theory. - Geoffrey Exoo (Discuss. Math. Graph Theory, 2004)

epsilon-Unit Distance Graphs. - Geoffrey Exoo (Discret. Comput. Geom., 2005)

Improved Identifying Codes in F2n. - Geoffrey Exoo; Tero Laihonen; Sanna M. Ranto (ISIT, 2007)

Improved Upper Bounds on Binary Identifying Codes. - Geoffrey Exoo; Tero Laihonen; Sanna M. Ranto (IEEE Trans. Inf. Theory, 2007)

Improved bounds on binary identifying codes. - Geoffrey Exoo; Ville Junnila; Tero Laihonen; Sanna M. Ranto (ISIT, 2008)

New bounds on binary identifying codes. - Geoffrey Exoo; Tero Laihonen; Sanna M. Ranto (Discret. Appl. Math., 2008)

Upper bounds for binary identifying codes. - Geoffrey Exoo; Ville Junnila; Tero Laihonen; Sanna M. Ranto (Adv. Appl. Math., 2009)

Properties of Groups for the Cage and Degree/Diameter Problems. - Robert Jajcay; Geoffrey Exoo (Electron. Notes Discret. Math., 2009)

On the limitations of the use of solvable groups in Cayley graph cage constructions. - Marston D. E. Conder; Geoffrey Exoo; Robert Jajcay (Eur. J. Comb., 2010)

Improved bounds on identifying codes in binary Hamming spaces. - Geoffrey Exoo; Ville Junnila; Tero Laihonen; Sanna M. Ranto (Eur. J. Comb., 2010)

Ranking measures for radially Moore graphs. - Carles Capdevila; Josep Conde; Geoffrey Exoo; Joan Gimbert; Nacho López (Networks, 2010)

Locating-dominating codes in cycles. - Geoffrey Exoo; Ville Junnila; Tero Laihonen (Australas. J Comb., 2011)

Locating-dominating codes in paths. - Geoffrey Exoo; Ville Junnila; Tero Laihonen (Discret. Math., 2011)

On the girth of voltage graph lifts. - Geoffrey Exoo; Robert Jajcay (Eur. J. Comb., 2011)

Computational determination of (3, 11) and (4, 7) cages. - Geoffrey Exoo; Brendan D. McKay; Wendy J. Myrvold; Jacqueline Nadon (J. Discrete Algorithms, 2011)

On the Ramsey Number R(4, 6). - Geoffrey Exoo (Electron. J. Comb., 2012)

Radial Moore graphs of radius three. - Geoffrey Exoo; Joan Gimbert; Nacho López; José Gómez (Discret. Appl. Math., 2012)

Recursive constructions of small regular graphs of given degree and girth. - Geoffrey Exoo; Robert Jajcay (Discret. Math., 2012)

On Some Small Classical Ramsey Numbers. - Geoffrey Exoo (Electron. J. Comb., 2013)

On the Chromatic Number of ℝ4. - Geoffrey Exoo; Dan Ismailescu; Michael Lim (Discret. Comput. Geom., 2014)

New Lower Bounds for 28 Classical Ramsey Numbers. - Geoffrey Exoo; Milos Tatarevic (Electron. J. Comb., 2015)

Small bi-regular graphs of even girth. - Gabriela Araujo-Pardo; Geoffrey Exoo; Robert Jajcay (Discret. Math., 2016)

Biregular Cages of Odd Girth. - Geoffrey Exoo; Robert Jajcay (J. Graph Theory, 2016)

Bounds for the smallest k-chromatic graphs of given girth. - Geoffrey Exoo; Jan Goedgebeur (Discret. Math. Theor. Comput. Sci., 2019)

On the defect of vertex-transitive graphs of given degree and diameter. - Geoffrey Exoo; Robert Jajcay; Martin Macaj; Jozef Sirán (J. Comb. Theory B, 2019)

The Chromatic Number of the Plane is At Least 5: A New Proof. - Geoffrey Exoo; Dan Ismailescu (Discret. Comput. Geom., 2020)

On Mixed Cages. - Geoffrey Exoo (Discret. Math. Theor. Comput. Sci., 2023)

On decreasing the orders of (k,g)-graphs. - Geoffrey Exoo; Robert Jajcay; Tom Raiman (J. Comb. Optim., 2023)

On large regular (1,1,k)-mixed graphs. - Cristina Dalfó; Grahame Erskine; Geoffrey Exoo; Miguel Angel Fiol; Nacho López; Arnau Messegué; James Tuite (Discret. Appl. Math., 2024)

Attainable bounds for algebraic connectivity and maximally connected regular graphs. - Geoffrey Exoo; Theodore Kolokolnikov; Jeanette Janssen; Timothy Salamon (J. Graph Theory, 2024)