Geoffrey Exoo - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 53 from 53

2023

On decreasing the orders of (k,g)-graphsGeoffrey Exoo, Robert Jajcay, Tom Raiman. jco, 46(4):26, November 2023. [doi]

2020

The Chromatic Number of the Plane is At Least 5: A New ProofGeoffrey Exoo, Dan Ismailescu. dcg, 64(1):216-226, 2020. [doi]

2019

On the defect of vertex-transitive graphs of given degree and diameterGeoffrey Exoo, Robert Jajcay, Martin Macaj, Jozef Sirán. JCT, 134:322-340, 2019. [doi]

Bounds for the smallest k-chromatic graphs of given girthGeoffrey Exoo, Jan Goedgebeur. dmtcs, 21(3), 2019. [doi]

2016

Small bi-regular graphs of even girthGabriela Araujo-Pardo, Geoffrey Exoo, Robert Jajcay. DM, 339(2):658-667, 2016. [doi]

Biregular Cages of Odd GirthGeoffrey Exoo, Robert Jajcay. jgt, 81(1):50-56, 2016. [doi]

2015

New Lower Bounds for 28 Classical Ramsey NumbersGeoffrey Exoo, Milos Tatarevic. combinatorics, 22(3):3, 2015. [doi]

2014

4Geoffrey Exoo, Dan Ismailescu, Michael Lim. dcg, 52(2):416-423, 2014. [doi]

2013

On Some Small Classical Ramsey NumbersGeoffrey Exoo. combinatorics, 20(1):68, 2013. [doi]

2012

Radial Moore graphs of radius threeGeoffrey Exoo, Joan Gimbert, Nacho López, José Gómez. DAM, 160(10-11):1507-1512, 2012. [doi]

On the Ramsey Number R(4, 6)Geoffrey Exoo. combinatorics, 19(1):66, 2012. [doi]

Recursive constructions of small regular graphs of given degree and girthGeoffrey Exoo, Robert Jajcay. DM, 312(17):2612-2619, 2012. [doi]

2011

On the girth of voltage graph liftsGeoffrey Exoo, Robert Jajcay. ejc, 32(4):554-562, 2011. [doi]

Computational determination of (3, 11) and (4, 7) cagesGeoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon. jda, 9(2):166-169, 2011. [doi]

Locating-dominating codes in pathsGeoffrey Exoo, Ville Junnila, Tero Laihonen. DM, 311(17):1863-1873, 2011. [doi]

Locating-dominating codes in cyclesGeoffrey Exoo, Ville Junnila, Tero Laihonen. ajc, 49:177-194, 2011. [doi]

2010

Ranking measures for radially Moore graphsCarles Capdevila, Josep Conde, Geoffrey Exoo, Joan Gimbert, Nacho López. networks, 56(4):255-262, 2010. [doi]

On the limitations of the use of solvable groups in Cayley graph cage constructionsMarston D. E. Conder, Geoffrey Exoo, Robert Jajcay. ejc, 31(7):1819-1828, 2010. [doi]

Improved bounds on identifying codes in binary Hamming spacesGeoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto. ejc, 31(3):813-827, 2010. [doi]

2009

Upper bounds for binary identifying codesGeoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto. aam, 42(3):277-289, 2009. [doi]

Properties of Groups for the Cage and Degree/Diameter ProblemsRobert Jajcay, Geoffrey Exoo. endm, 34:341-345, 2009. [doi]

2008

New bounds on binary identifying codesGeoffrey Exoo, Tero Laihonen, Sanna M. Ranto. DAM, 156(12):2250-2263, 2008. [doi]

Improved bounds on binary identifying codesGeoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto. isit 2008: 629-633 [doi]

2007

Improved Upper Bounds on Binary Identifying CodesGeoffrey Exoo, Tero Laihonen, Sanna M. Ranto. TIT, 53(11):4255-4260, 2007. [doi]

nGeoffrey Exoo, Tero Laihonen, Sanna M. Ranto. isit 2007: 1021-1025 [doi]

2005

epsilon-Unit Distance GraphsGeoffrey Exoo. dcg, 33(1):117-123, 2005. [doi]

2004

Some applications of pq-groups in graph theoryGeoffrey Exoo. dmgt, 24(1):109-114, 2004. [doi]

Voltage Graphs, Group Presentations and CagesGeoffrey Exoo. combinatorics, 11(1), 2004. [doi]

Constructive Lower Bounds on Classical Multicolor Ramsey NumbersXu Xiaodong, Xie Zheng, Geoffrey Exoo, Stanislaw P. Radziszowski. combinatorics, 11(1), 2004. [doi]

2003

A Euclidean Ramsey ProblemGeoffrey Exoo. dcg, 29(2):223-227, 2003. [doi]

2002

Totally magic graphsGeoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis. DM, 254(1-3):103-113, 2002. [doi]

A Small Trivalent Graph of Girth 14Geoffrey Exoo. combinatorics, 9(1), 2002. [doi]

2001

A family of graphs and the degree/diameter problemGeoffrey Exoo. jgt, 37(2):118-124, 2001. [doi]

A trivalent graph of girth 17Geoffrey Exoo. ajc, 24:261-264, 2001. [doi]

1998

Some New Ramsey ColoringsGeoffrey Exoo. combinatorics, 5, 1998. [doi]

1996

A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16Geoffrey Exoo. combinatorics, 3(1), 1996. [doi]

1994

A Lower Bound for Schur Numbers and Multicolor Ramsey NumbersGeoffrey Exoo. combinatorics, 1, 1994. [doi]

1992

On set systems not containing delta systemsH. L. Abbott, Geoffrey Exoo. gc, 8(1):1-9, 1992. [doi]

1991

A bipartite Ramsey numberGeoffrey Exoo. gc, 7(4):395-396, 1991. [doi]

Three color Ramsey number of K::4::-eGeoffrey Exoo. DM, 89(3):301-305, 1991. [doi]

1989

5 - eC. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan. jgt, 13(1):7-15, 1989. [doi]

A lower bound for r(5, 5)Geoffrey Exoo. jgt, 13(1):97-98, 1989. [doi]

On Two Classical Ramsey Numbers of the Form R(3, n)Geoffrey Exoo. siamdm, 2(4):488-490, 1989.

1988

Ramsey numbers based on C::5::-decompositionsGeoffrey Exoo, Donald F. Reynolds. DM, 71(2):119-127, 1988. [doi]

1983

On line disjoint paths of bounded lengthGeoffrey Exoo. DM, 44(3):317-318, 1983. [doi]

1982

The smallest 2-connected cubic bipartite planar nonhamiltonian graphTakao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary. DM, 38(1):1-6, 1982. [doi]

A counterexample to a conjecture on paths of bounded lengthStephanie M. Boyles, Geoffrey Exoo. jgt, 6(2):205-209, 1982. [doi]

On a measure of communication network vulnerabilityGeoffrey Exoo. networks, 12(4):405-409, 1982. [doi]

1981

Further results on graph equations for line graphs and n-th power graphsJin Akiyama, Hiroshi Era, Geoffrey Exoo. DM, 34(3):209-218, 1981. [doi]

Covering and packing in graphs IV: Linear arboricityJin Akiyama, Geoffrey Exoo, Frank Harary. networks, 11(1):69-72, 1981. [doi]

Paley graphs satisfy all first-order adjacency axiomsAndreas Blass, Geoffrey Exoo, Frank Harary. jgt, 5(4):435-439, 1981. [doi]

On an adjacency property of graphsGeoffrey Exoo. jgt, 5(4):371-378, 1981. [doi]

1980

The smallest graphs with certain adjacency propertiesGeoffrey Exoo, Frank Harary. DM, 29(1):25-32, 1980. [doi]

Sign in or sign up to see more results.

runs on WebDSL