default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeoffrey Exoo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j52]Cristina Dalfó
, Grahame Erskine, Geoffrey Exoo, Miguel Angel Fiol, Nacho López, Arnau Messegué, James Tuite:
On large regular (1,1,k)-mixed graphs. Discret. Appl. Math. 356: 209-228 (2024)- 2023
- [j51]Geoffrey Exoo, Robert Jajcay, Tom Raiman:
On decreasing the orders of (k,g)-graphs. J. Comb. Optim. 46(4): 26 (2023) - 2020
- [j50]Geoffrey Exoo, Dan Ismailescu:
The Chromatic Number of the Plane is At Least 5: A New Proof. Discret. Comput. Geom. 64(1): 216-226 (2020)
2010 – 2019
- 2019
- [j49]Geoffrey Exoo, Jan Goedgebeur:
Bounds for the smallest k-chromatic graphs of given girth. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [j48]Geoffrey Exoo, Robert Jajcay, Martin Macaj, Jozef Sirán:
On the defect of vertex-transitive graphs of given degree and diameter. J. Comb. Theory B 134: 322-340 (2019) - 2018
- [i1]Geoffrey Exoo, Jan Goedgebeur:
Bounds for the smallest k-chromatic graphs of given girth. CoRR abs/1805.06713 (2018) - 2016
- [j47]Gabriela Araujo-Pardo, Geoffrey Exoo, Robert Jajcay:
Small bi-regular graphs of even girth. Discret. Math. 339(2): 658-667 (2016) - [j46]Geoffrey Exoo, Robert Jajcay:
Biregular Cages of Odd Girth. J. Graph Theory 81(1): 50-56 (2016) - 2015
- [j45]Geoffrey Exoo, Milos Tatarevic:
New Lower Bounds for 28 Classical Ramsey Numbers. Electron. J. Comb. 22(3): 3 (2015) - 2014
- [j44]Geoffrey Exoo, Dan Ismailescu, Michael Lim:
On the Chromatic Number of ℝ4. Discret. Comput. Geom. 52(2): 416-423 (2014) - 2013
- [j43]Geoffrey Exoo:
On Some Small Classical Ramsey Numbers. Electron. J. Comb. 20(1): 68 (2013) - 2012
- [j42]Geoffrey Exoo:
On the Ramsey Number R(4, 6). Electron. J. Comb. 19(1): 66 (2012) - [j41]Geoffrey Exoo, Joan Gimbert, Nacho López, José Gómez:
Radial Moore graphs of radius three. Discret. Appl. Math. 160(10-11): 1507-1512 (2012) - [j40]Geoffrey Exoo, Robert Jajcay:
Recursive constructions of small regular graphs of given degree and girth. Discret. Math. 312(17): 2612-2619 (2012) - 2011
- [j39]Geoffrey Exoo, Ville Junnila, Tero Laihonen:
Locating-dominating codes in cycles. Australas. J Comb. 49: 177-194 (2011) - [j38]Geoffrey Exoo, Ville Junnila, Tero Laihonen:
Locating-dominating codes in paths. Discret. Math. 311(17): 1863-1873 (2011) - [j37]Geoffrey Exoo, Robert Jajcay:
On the girth of voltage graph lifts. Eur. J. Comb. 32(4): 554-562 (2011) - [j36]Geoffrey Exoo, Brendan D. McKay, Wendy J. Myrvold, Jacqueline Nadon:
Computational determination of (3, 11) and (4, 7) cages. J. Discrete Algorithms 9(2): 166-169 (2011) - 2010
- [j35]Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto:
Improved bounds on identifying codes in binary Hamming spaces. Eur. J. Comb. 31(3): 813-827 (2010) - [j34]Marston D. E. Conder, Geoffrey Exoo, Robert Jajcay:
On the limitations of the use of solvable groups in Cayley graph cage constructions. Eur. J. Comb. 31(7): 1819-1828 (2010) - [j33]Carles Capdevila, Josep Conde, Geoffrey Exoo, Joan Gimbert, Nacho López:
Ranking measures for radially Moore graphs. Networks 56(4): 255-262 (2010)
2000 – 2009
- 2009
- [j32]Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto:
Upper bounds for binary identifying codes. Adv. Appl. Math. 42(3): 277-289 (2009) - [j31]Robert Jajcay, Geoffrey Exoo:
Properties of Groups for the Cage and Degree/Diameter Problems. Electron. Notes Discret. Math. 34: 341-345 (2009) - 2008
- [j30]Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto:
New bounds on binary identifying codes. Discret. Appl. Math. 156(12): 2250-2263 (2008) - [c2]Geoffrey Exoo, Ville Junnila, Tero Laihonen, Sanna M. Ranto:
Improved bounds on binary identifying codes. ISIT 2008: 629-633 - 2007
- [j29]Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto:
Improved Upper Bounds on Binary Identifying Codes. IEEE Trans. Inf. Theory 53(11): 4255-4260 (2007) - [c1]Geoffrey Exoo, Tero Laihonen, Sanna M. Ranto:
Improved Identifying Codes in F2n. ISIT 2007: 1021-1025 - 2005
- [j28]Geoffrey Exoo:
epsilon-Unit Distance Graphs. Discret. Comput. Geom. 33(1): 117-123 (2005) - 2004
- [j27]Geoffrey Exoo:
Voltage Graphs, Group Presentations and Cages. Electron. J. Comb. 11(1) (2004) - [j26]Xiaodong Xu, Xie Zheng, Geoffrey Exoo, Stanislaw P. Radziszowski:
Constructive Lower Bounds on Classical Multicolor Ramsey Numbers. Electron. J. Comb. 11(1) (2004) - [j25]Geoffrey Exoo:
Some applications of pq-groups in graph theory. Discuss. Math. Graph Theory 24(1): 109-114 (2004) - 2003
- [j24]Geoffrey Exoo:
A Euclidean Ramsey Problem. Discret. Comput. Geom. 29(2): 223-227 (2003) - 2002
- [j23]Geoffrey Exoo:
A Small Trivalent Graph of Girth 14. Electron. J. Comb. 9(1) (2002) - [j22]Geoffrey Exoo, Alan C. H. Ling, John P. McSorley, Nicholas C. K. Phillips, Walter D. Wallis:
Totally magic graphs. Discret. Math. 254(1-3): 103-113 (2002) - 2001
- [j21]Geoffrey Exoo:
A trivalent graph of girth 17. Australas. J Comb. 24: 261-264 (2001) - [j20]Geoffrey Exoo:
A family of graphs and the degree/diameter problem. J. Graph Theory 37(2): 118-124 (2001)
1990 – 1999
- 1998
- [j19]Geoffrey Exoo:
Some New Ramsey Colorings. Electron. J. Comb. 5 (1998) - 1996
- [j18]Geoffrey Exoo:
A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16. Electron. J. Comb. 3(1) (1996) - 1994
- [j17]Geoffrey Exoo:
A Lower Bound for Schur Numbers and Multicolor Ramsey Numbers. Electron. J. Comb. 1 (1994) - 1992
- [j16]H. L. Abbott, Geoffrey Exoo:
On set systems not containing delta systems. Graphs Comb. 8(1): 1-9 (1992) - 1991
- [j15]Geoffrey Exoo:
Three color Ramsey number of K4-e. Discret. Math. 89(3): 301-305 (1991) - [j14]Geoffrey Exoo:
A bipartite Ramsey number. Graphs Comb. 7(4): 395-396 (1991)
1980 – 1989
- 1989
- [j13]C. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan:
The ramsey number of k5 - e. J. Graph Theory 13(1): 7-15 (1989) - [j12]Geoffrey Exoo:
A lower bound for r(5, 5). J. Graph Theory 13(1): 97-98 (1989) - [j11]Geoffrey Exoo:
On Two Classical Ramsey Numbers of the Form R(3, n). SIAM J. Discret. Math. 2(4): 488-490 (1989) - 1988
- [j10]Geoffrey Exoo, Donald F. Reynolds:
Ramsey numbers based on C5-decompositions. Discret. Math. 71(2): 119-127 (1988) - 1983
- [j9]Geoffrey Exoo:
On line disjoint paths of bounded length. Discret. Math. 44(3): 317-318 (1983) - 1982
- [j8]Takao Asano, Nobuji Saito, Geoffrey Exoo, Frank Harary:
The smallest 2-connected cubic bipartite planar nonhamiltonian graph. Discret. Math. 38(1): 1-6 (1982) - [j7]Stephanie M. Boyles, Geoffrey Exoo:
A counterexample to a conjecture on paths of bounded length. J. Graph Theory 6(2): 205-209 (1982) - [j6]Geoffrey Exoo:
On a measure of communication network vulnerability. Networks 12(4): 405-409 (1982) - 1981
- [j5]Jin Akiyama, Hiroshi Era, Geoffrey Exoo:
Further results on graph equations for line graphs and n-th power graphs. Discret. Math. 34(3): 209-218 (1981) - [j4]Geoffrey Exoo:
On an adjacency property of graphs. J. Graph Theory 5(4): 371-378 (1981) - [j3]Andreas Blass, Geoffrey Exoo, Frank Harary:
Paley graphs satisfy all first-order adjacency axioms. J. Graph Theory 5(4): 435-439 (1981) - [j2]Jin Akiyama, Geoffrey Exoo, Frank Harary:
Covering and packing in graphs IV: Linear arboricity. Networks 11(1): 69-72 (1981) - 1980
- [j1]Geoffrey Exoo, Frank Harary:
The smallest graphs with certain adjacency properties. Discret. Math. 29(1): 25-32 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
