default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGrahame Erskine
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]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)- [j15]Grahame Erskine, Terry S. Griggs:
Properties of Steiner triple systems of order 21. Discret. Math. 347(11): 114158 (2024) - [j14]Maya G. S. Thankachy, S. V. Ullas Chandran, James Tuite, Elias John Thomas, Gabriele Di Stefano, Grahame Erskine:
On the vertex position number of graphs. Discuss. Math. Graph Theory 44(3): 1169 (2024) - [i1]Tymoteusz Chojecki, Grahame Erskine, James Tuite, Vasyl Ustimenko:
On affine forestry over integral domains and families of deep Jordan-Gauss graphs. IACR Cryptol. ePrint Arch. 2024: 1156 (2024) - 2023
- [j13]Grahame Erskine, James Tuite:
Small Graphs and Hypergraphs of Given Degree and Girth. Electron. J. Comb. 30(1) (2023) - [j12]James Tuite, Grahame Erskine, Nika Salia:
Turán Problems for k-Geodetic Digraphs. Graphs Comb. 39(2): 25 (2023) - 2022
- [j11]Grahame Erskine, Terry S. Griggs, Jozef Sirán:
Clique-partitioned graphs. Discret. Appl. Math. 314: 238-248 (2022) - [j10]James Tuite, Grahame Erskine:
On Networks with Order Close to the Moore Bound. Graphs Comb. 38(5): 143 (2022) - 2021
- [j9]Grahame Erskine, Peter Fratric, Jozef Sirán:
Graphs derived from perfect difference sets. Australas. J Comb. 80: 48-56 (2021) - 2020
- [j8]Grahame Erskine, Katarína Hrináková, Olivia Reade Jeans:
Self-dual, self-Petrie-dual and Möbius regular maps on linear fractional groups. Art Discret. Appl. Math. 3(1) (2020) - [j7]Grahame Erskine, Terry S. Griggs, Jozef Sirán:
On the upper embedding of symmetric configurations with block size 3. Discret. Math. 343(4): 111774 (2020)
2010 – 2019
- 2019
- [j6]James Tuite, Grahame Erskine:
On Total Regularity of Mixed Graphs with Order Close to the Moore Bound. Graphs Comb. 35(6): 1253-1272 (2019) - 2018
- [j5]Grahame Erskine, James Tuite:
Large Cayley graphs of small diameter. Discret. Appl. Math. 250: 202-214 (2018) - 2017
- [j4]David I. Bevan, Grahame Erskine, Robert Lewis:
Large circulant graphs of fixed diameter and arbitrary degree. Ars Math. Contemp. 13(2): 275-291 (2017) - [j3]Grahame Erskine:
Mixed Moore Cayley Graphs. J. Interconnect. Networks 17(3-4): 1741010:1-1741010:9 (2017) - 2016
- [j2]Dominique Buset, Mourad El Amiri, Grahame Erskine, Mirka Miller, Hebert Pérez-Rosés:
A revised Moore bound for mixed graphs. Discret. Math. 339(8): 2066-2069 (2016) - 2015
- [j1]Grahame Erskine:
Diameter 2 Cayley graphs of dihedral groups. Discret. Math. 338(6): 1022-1024 (2015)
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 22:09 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:
