default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRalph Gordon Stanton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j17]Ralph Gordon Stanton:
Four Colour Classes in Projective Planes with Non-Fano Quads. Ars Comb. 83 (2007)- 2004
- [j16]Mike J. Grannell, Terry S. Griggs, Ralph Gordon Stanton:
Minimal perfect bicoverings of Kv with block sizes two, three and four. Ars Comb. 71 (2004) - 2003
- [j15]Mike J. Grannell, Terry S. Griggs, Kathleen A. S. Quinn, Barbara M. Maenhaut, Ralph Gordon Stanton:
More on exact bicoverings of 12 points. Ars Comb. 69 (2003) - 2002
- [j14]Ralph Gordon Stanton:
Non-isomorphic Minimal Bicovers of K8. Ars Comb. 62 (2002) - 2000
- [j13]J. L. Allston, Mike J. Grannell, Terry S. Griggs, Kathleen A. S. Quinn, Ralph Gordon Stanton:
On exact bicoverings of 12 points. Ars Comb. 55 (2000) - [j12]Ralph Gordon Stanton, William L. Kocay:
Fano Quads in Projective Planes. Ars Comb. 57 (2000)
1990 – 1999
- 1999
- [j11]Mike J. Grannell, Terry S. Griggs, Kathleen A. S. Quinn, Ralph Gordon Stanton:
A census of minimum pair-coverings with restricted largest block length. Ars Comb. 52 (1999) - 1997
- [j10]Ralph Gordon Stanton:
Ryser Designs. Ars Comb. 46 (1997) - 1995
- [j9]R. G. Stanton:
A study of hendecads. Australas. J Comb. 11: 239-246 (1995) - 1992
- [j8]R. G. Stanton:
Packings in enneads. Australas. J Comb. 6: 125-134 (1992) - 1991
- [j7]R. G. Stanton:
The geometric points of coverings. Australas. J Comb. 4: 253-260 (1991) - 1990
- [j6]R. G. Stanton, R. W. Buskens:
Excess graphs and bicoverings. Australas. J Comb. 1: 207-210 (1990) - [j5]R. G. Stanton, R. W. Buskens:
An upper approximation to the BIBD (15, 21, 7, 5, 2). Australas. J Comb. 2: 181-190 (1990)
1980 – 1989
- 1989
- [j4]R. G. Stanton:
Minimal pairwise balanced designs. Discret. Math. 77(1-3): 317-321 (1989)
1970 – 1979
- 1974
- [j3]Vinton G. Cerf, Donald D. Cowan, Ronald C. Mullin, R. G. Stanton:
A lower bound on the average shortest path length in regular graphs. Networks 4(4): 335-342 (1974) - 1972
- [j2]R. G. Stanton, Joseph Douglas Horton:
A Multiplication Theorem for Room Squares. J. Comb. Theory A 12(3): 322-325 (1972) - 1971
- [j1]J. G. Kalbfleisch, R. G. Stanton, Joseph Douglas Horton:
On Covering Sets and Error-Correcting Codes. J. Comb. Theory A 11(3): 233-250 (1971)
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-06-10 21:23 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:
