Peter J. Cameron
Orcid: 0000-0003-3130-9505Affiliations:
- University of St Andrews, School of Mathematics and Statistic, Scotland, UK
- Queen Mary University of London, School of Mathematical Sciences, UK
According to our database1,
Peter J. Cameron
authored at least 142 papers
between 1973 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on id.loc.gov
-
on d-nb.info
On csauthors.net:
Bibliography
2025
2024
J. Comb. Theory, Ser. A, 2024
2023
Minimum degrees of finite rectangular bands, null semigroups, and variants of full transformation semigroups.
Comb. Theory, 2023
2022
2021
Electron. J. Comb., 2021
AKCE Int. J. Graphs Comb., 2021
2020
Graphs Comb., 2020
2019
Smallest cyclically covering subspaces of Fqn, and lower bounds in Isbell's conjecture.
Eur. J. Comb., 2019
2018
2017
Des. Codes Cryptogr., 2017
Electron. J. Comb., 2017
2016
2015
Most switching classes with primitive automorphism groups contain graphs with trivial groups.
Australas. J Comb., 2015
2014
J. Comb. Theory B, 2014
2013
Theor. Comput. Sci., 2013
2012
CoRR, 2012
2011
2010
Discret. Math., 2010
2009
2008
Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes.
Am. Math. Mon., 2008
2007
Electron. Notes Discret. Math., 2007
Des. Codes Cryptogr., 2007
2006
2005
Discret. Math., 2005
2004
2003
Discret. Math., 2003
2002
Eur. J. Comb., 2002
Electron. J. Comb., 2002
2001
2000
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components.
Electron. J. Comb., 2000
Electron. J. Comb., 2000
1999
1998
1997
1996
Eur. J. Comb., 1996
1995
1994
1993
1992
Discret. Math., 1992
1991
1990
1989
Eur. J. Comb., 1989
1988
1987
1986
1985
J. Comb. Theory B, 1985
Graphs Comb., 1985
1983
1982
There are only finitely many finite distance-transitive graphs of given valency greater than two.
Comb., 1982
1981
1980
1978
1977
1976
J. Comb. Theory A, 1976
1973