Geoffrey Exoo

59 papers B 2Journal 57
YearRankTypeTitle / Venue / Authors
2025 J jnl
New small regular graphs of given girth: the cage problem and beyond.
CoRR
Geoffrey Exoo, Jan Goedgebeur, Jorik Jooken, Louis Stubbe, Tibo Van den Eede
2025 J jnl
On bipartite (1,1,k)-mixed graphs.
Art Discret. Appl. Math.
Cristina Dalfó, Grahame Erskine, Geoffrey Exoo, Miguel Angel Fiol, James Tuite
2024 J jnl
Attainable bounds for algebraic connectivity and maximally connected regular graphs.
J. Graph Theory
Geoffrey Exoo, Theodore Kolokolnikov, Jeanette Janssen, Timothy Salamon
2024 J jnl
On large regular (1,1,k)-mixed graphs.
Discret. Appl. Math.
Cristina Dalfó, Grahame Erskine, Geoffrey Exoo, Miguel Angel Fiol, Nacho López, Arnau Messegué, James Tuite
2023 J jnl
On Mixed Cages.
Discret. Math. Theor. Comput. Sci.
Geoffrey Exoo
2023 J jnl
On decreasing the orders of (k,g)-graphs.
J. Comb. Optim.
Geoffrey Exoo, Robert Jajcay, Tom Raiman
2020 J jnl
The Chromatic Number of the Plane is At Least 5: A New Proof.
Discret. Comput. Geom.
Geoffrey Exoo, Dan Ismailescu
2019 J jnl
Bounds for the smallest k-chromatic graphs of given girth.
Discret. Math. Theor. Comput. Sci.
Geoffrey Exoo, Jan Goedgebeur
2019 J jnl
On the defect of vertex-transitive graphs of given degree and diameter.
J. Comb. Theory B
Geoffrey Exoo, Robert Jajcay, Martin Macaj, Jozef Sirán
2018 J jnl
Bounds for the smallest k-chromatic graphs of given girth.
CoRR
Geoffrey Exoo, Jan Goedgebeur
2016 J jnl
Biregular Cages of Odd Girth.
J. Graph Theory
Geoffrey Exoo, Robert Jajcay
2016 J jnl
Small bi-regular graphs of even girth.
Discret. Math.
Gabriela Araujo-Pardo, Geoffrey Exoo, Robert Jajcay
2015 J jnl
New Lower Bounds for 28 Classical Ramsey Numbers.
Electron. J. Comb.
Geoffrey Exoo, Milos Tatarevic
2014 J jnl
On the Chromatic Number of ℝ
Discret. Comput. Geom.
Geoffrey Exoo, Dan Ismailescu, Michael Lim
2013 J jnl
On Some Small Classical Ramsey Numbers.
Electron. J. Comb.
Geoffrey Exoo
2012 J jnl
On the Ramsey Number R(4, 6).
Electron. J. Comb.
Geoffrey Exoo
2012 J jnl
Radial Moore graphs of radius three.
Discret. Appl. Math.
Geoffrey Exoo, Joan Gimbert, Nacho López, José Gómez
2012 J jnl
Recursive constructions of small regular graphs of given degree and girth.
Discret. Math.
Geoffrey Exoo, Robert Jajcay
2011 J jnl
Computational determination of (3, 11) and (4, 7) cages.
J. Discrete Algorithms
Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon
2011 J jnl
Locating-dominating codes in cycles.
Australas. J Comb.
Geoffrey Exoo, Ville Junnila, Tero Laihonen
2011 J jnl
Locating-dominating codes in paths.
Discret. Math.
Geoffrey Exoo, Ville Junnila, Tero Laihonen
2011 J jnl
On the girth of voltage graph lifts.
Eur. J. Comb.
Geoffrey Exoo, Robert Jajcay
2010 J jnl
Improved bounds on identifying codes in binary Hamming spaces.
Eur. J. Comb.
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
2010 J jnl
On the limitations of the use of solvable groups in Cayley graph cage constructions.
Eur. J. Comb.
Marston D. E. Conder, Geoffrey Exoo, Robert Jajcay
2010 J jnl
Ranking measures for radially Moore graphs.
Networks
Carles Capdevila, Josep Conde, Geoffrey Exoo, Joan Gimbert, Nacho López
2009 J jnl
Properties of Groups for the Cage and Degree/Diameter Problems.
Electron. Notes Discret. Math.
Robert Jajcay, Geoffrey Exoo
2009 J jnl
Upper bounds for binary identifying codes.
Adv. Appl. Math.
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
2008 B conf
Improved bounds on binary identifying codes.
ISIT
Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto
2008 J jnl
New bounds on binary identifying codes.
Discret. Appl. Math.
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
2007 B conf
Improved Identifying Codes in F2
ISIT
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
2007 J jnl
Improved Upper Bounds on Binary Identifying Codes.
IEEE Trans. Inf. Theory
Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto
2005 J jnl
epsilon-Unit Distance Graphs.
Discret. Comput. Geom.
Geoffrey Exoo
2004 J jnl
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers.
Electron. J. Comb.
Xiaodong Xu, Xie Zheng, Geoffrey Exoo, Stanislaw P. Radziszowski
2004 J jnl
Some applications of pq-groups in graph theory.
Discuss. Math. Graph Theory
Geoffrey Exoo
2004 J jnl
Voltage Graphs, Group Presentations and Cages.
Electron. J. Comb.
Geoffrey Exoo
2003 J jnl
A Euclidean Ramsey Problem.
Discret. Comput. Geom.
Geoffrey Exoo
2002 J jnl
A Small Trivalent Graph of Girth 14.
Electron. J. Comb.
Geoffrey Exoo
2002 J jnl
Totally magic graphs.
Discret. Math.
Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis
2001 J jnl
A family of graphs and the degree/diameter problem.
J. Graph Theory
Geoffrey Exoo
2001 J jnl
A trivalent graph of girth 17.
Australas. J Comb.
Geoffrey Exoo
1998 J jnl
Some New Ramsey Colorings.
Electron. J. Comb.
Geoffrey Exoo
1996 J jnl
A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16.
Electron. J. Comb.
Geoffrey Exoo
1994 J jnl
A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers.
Electron. J. Comb.
Geoffrey Exoo
1992 J jnl
On set systems not containing delta systems.
Graphs Comb.
H. L. Abbott, Geoffrey Exoo
1991 J jnl
A bipartite Ramsey number.
Graphs Comb.
Geoffrey Exoo
1991 J jnl
Three color Ramsey number of K
Discret. Math.
Geoffrey Exoo
1989 J jnl
A lower bound for r(5, 5).
J. Graph Theory
Geoffrey Exoo
1989 J jnl
On Two Classical Ramsey Numbers of the Form R(3, n).
SIAM J. Discret. Math.
Geoffrey Exoo
1989 J jnl
The ramsey number of k
J. Graph Theory
C. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan
1988 J jnl
Ramsey numbers based on C
Discret. Math.
Geoffrey Exoo, Donald F. Reynolds
1983 J jnl
On line disjoint paths of bounded length.
Discret. Math.
Geoffrey Exoo
1982 J jnl
A counterexample to a conjecture on paths of bounded length.
J. Graph Theory
Stephanie M. Boyles, Geoffrey Exoo
1982 J jnl
On a measure of communication network vulnerability.
Networks
Geoffrey Exoo
1982 J jnl
The smallest 2-connected cubic bipartite planar nonhamiltonian graph.
Discret. Math.
Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary
1981 J jnl
Covering and packing in graphs IV: Linear arboricity.
Networks
Jin Akiyama, Geoffrey Exoo, Frank Harary
1981 J jnl
Further results on graph equations for line graphs and n-th power graphs.
Discret. Math.
Jin Akiyama, Hiroshi Era, Geoffrey Exoo
1981 J jnl
On an adjacency property of graphs.
J. Graph Theory
Geoffrey Exoo
1981 J jnl
Paley graphs satisfy all first-order adjacency axioms.
J. Graph Theory
Andreas Blass, Geoffrey Exoo, Frank Harary
1980 J jnl
The smallest graphs with certain adjacency properties.
Discret. Math.
Geoffrey Exoo, Frank Harary