Geoffrey Exoo

Orcid: 0000-0003-2023-8887

According to our database1, Geoffrey Exoo authored at least 53 papers between 1980 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
On decreasing the orders of (k,g)-graphs.
J. Comb. Optim., November, 2023

2020
The Chromatic Number of the Plane is At Least 5: A New Proof.
Discret. Comput. Geom., 2020

2019
On the defect of vertex-transitive graphs of given degree and diameter.
J. Comb. Theory B, 2019

Bounds for the smallest k-chromatic graphs of given girth.
Discret. Math. Theor. Comput. Sci., 2019

2016
Biregular Cages of Odd Girth.
J. Graph Theory, 2016

Small bi-regular graphs of even girth.
Discret. Math., 2016

2015
New Lower Bounds for 28 Classical Ramsey Numbers.
Electron. J. Comb., 2015

2014
On the Chromatic Number of ℝ<sup>4</sup>.
Discret. Comput. Geom., 2014

2013
On Some Small Classical Ramsey Numbers.
Electron. J. Comb., 2013

2012
Recursive constructions of small regular graphs of given degree and girth.
Discret. Math., 2012

Radial Moore graphs of radius three.
Discret. Appl. Math., 2012

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

2011
Computational determination of (3, 11) and (4, 7) cages.
J. Discrete Algorithms, 2011

On the girth of voltage graph lifts.
Eur. J. Comb., 2011

Locating-dominating codes in paths.
Discret. Math., 2011

Locating-dominating codes in cycles.
Australas. J Comb., 2011

2010
Ranking measures for radially Moore graphs.
Networks, 2010

Improved bounds on identifying codes in binary Hamming spaces.
Eur. J. Comb., 2010

On the limitations of the use of solvable groups in Cayley graph cage constructions.
Eur. J. Comb., 2010

2009
Properties of Groups for the Cage and Degree/Diameter Problems.
Electron. Notes Discret. Math., 2009

Upper bounds for binary identifying codes.
Adv. Appl. Math., 2009

2008
New bounds on binary identifying codes.
Discret. Appl. Math., 2008

Improved bounds on binary identifying codes.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
Improved Upper Bounds on Binary Identifying Codes.
IEEE Trans. Inf. Theory, 2007

Improved Identifying Codes in F2<sup>n</sup>.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2005
epsilon-Unit Distance Graphs.
Discret. Comput. Geom., 2005

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

Constructive Lower Bounds on Classical Multicolor Ramsey Numbers.
Electron. J. Comb., 2004

Voltage Graphs, Group Presentations and Cages.
Electron. J. Comb., 2004

2003
A Euclidean Ramsey Problem.
Discret. Comput. Geom., 2003

2002
Totally magic graphs.
Discret. Math., 2002

A Small Trivalent Graph of Girth 14.
Electron. J. Comb., 2002

2001
A family of graphs and the degree/diameter problem.
J. Graph Theory, 2001

A trivalent graph of girth 17.
Australas. J Comb., 2001

1998
Some New Ramsey Colorings.
Electron. J. Comb., 1998

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

1994
A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers.
Electron. J. Comb., 1994

1992
On set systems not containing delta systems.
Graphs Comb., 1992

1991
A bipartite Ramsey number.
Graphs Comb., 1991

Three color Ramsey number of K<sub>4</sub>-e.
Discret. Math., 1991

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

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

The ramsey number of k<sub>5</sub> - e.
J. Graph Theory, 1989

1988
Ramsey numbers based on C<sub>5</sub>-decompositions.
Discret. Math., 1988

1983
On line disjoint paths of bounded length.
Discret. Math., 1983

1982
On a measure of communication network vulnerability.
Networks, 1982

A counterexample to a conjecture on paths of bounded length.
J. Graph Theory, 1982

The smallest 2-connected cubic bipartite planar nonhamiltonian graph.
Discret. Math., 1982

1981
Covering and packing in graphs IV: Linear arboricity.
Networks, 1981

On an adjacency property of graphs.
J. Graph Theory, 1981

Paley graphs satisfy all first-order adjacency axioms.
J. Graph Theory, 1981

Further results on graph equations for line graphs and n-th power graphs.
Discret. Math., 1981

1980
The smallest graphs with certain adjacency properties.
Discret. Math., 1980


  Loading...