default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter J. Cameron
Peter Jephson Cameron
Person information
- affiliation: University of St Andrews, School of Mathematics and Statistic, Scotland, UK
- affiliation: Queen Mary University of London, School of Mathematical Sciences, UK
- award (2003): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j140]David Bradley-Williams, Peter J. Cameron
, Jan Hubicka, Matej Konecný:
EPPA numbers of graphs. J. Comb. Theory B 170: 203-224 (2025)- 2024
- [j139]Peter J. Cameron:
What can graphs and algebraic structures say to each other? AKCE Int. J. Graphs Comb. 21(3): 249-254 (2024) - [j138]G. Arunkumar, Peter J. Cameron, Rajat Kanti Nath:
Super graphs on groups, II. Discret. Appl. Math. 359: 371-382 (2024) - [j137]Sucharita Biswas, Peter J. Cameron, Angsuman Das, Hiranya Kishore Dey:
On the difference of the enhanced power graph and the power graph of a finite group. J. Comb. Theory, Ser. A 208: 105932 (2024) - 2023
- [j136]Peter J. Cameron, Veronica Phan:
Enhanced power graphs are weakly perfect. Australas. J Comb. 85: 100-105 (2023) - [j135]Peter J. Cameron, James East, Desmond G. Fitzgerald, James D. Mitchell, Luke Pebody, Thomas Quinn-Gregson:
Minimum degrees of finite rectangular bands, null semigroups, and variants of full transformation semigroups. Comb. Theory 3(3) (2023) - [j134]Parthajit Bhowal, Peter J. Cameron, Rajat Kanti Nath, Benjamin Sambale:
Solvable conjugacy class graph of groups. Discret. Math. 346(8): 113467 (2023) - [j133]G. Arunkumar, Peter J. Cameron, T. Kavaskar, T. Tamizh Chelvam:
Induced subgraphs of zero-divisor graphs. Discret. Math. 346(10): 113580 (2023) - [j132]Peter J. Cameron, Bojan Kuzma:
Between the enhanced power graph and the commuting graph. J. Graph Theory 102(2): 295-303 (2023) - [i8]David Bradley-Williams, Peter J. Cameron, Jan Hubicka, Matej Konecný:
EPPA numbers of graphs. CoRR abs/2311.07995 (2023) - 2022
- [j131]Rosemary A. Bailey, Peter J. Cameron, Michael Kinyon, Cheryl E. Praeger:
Diagonal groups and arcs over groups. Des. Codes Cryptogr. 90(9): 2069-2080 (2022) - [j130]G. Arunkumar, Peter J. Cameron, Rajat Kanti Nath, Lavanya Selvaganesh:
Super Graphs on Groups, I. Graphs Comb. 38(3): 100 (2022) - [j129]Peter J. Cameron, R. Raveendra Prathap, T. Tamizh Chelvam:
Subgroup Sum Graphs of Finite Abelian Groups. Graphs Comb. 38(4): 114 (2022) - [i7]Vikraman Arvind, Peter J. Cameron:
Recognizing the Commuting Graph of a Finite Group. CoRR abs/2206.01059 (2022) - 2021
- [j128]Ajay Kumar, Lavanya Selvaganesh, Peter J. Cameron, T. Tamizh Chelvam:
Recent developments on the power graph of finite groups - a survey. AKCE Int. J. Graphs Comb. 18(2): 65-94 (2021) - [j127]Peter J. Cameron, Saul D. Freedman, Colva M. Roney-Dougal:
The Non-Commuting, Non-Generating Graph of a Nilpotent Group. Electron. J. Comb. 28(1): 1 (2021) - [j126]Pallabi Manna, Peter J. Cameron, Ranjit Mehatari:
Forbidden Subgraphs of Power Graphs. Electron. J. Comb. 28(3): 3 (2021) - 2020
- [j125]Peter J. Cameron, Sean Eberhard:
On the paper "Association schemes for diagonal groups". Australas. J Comb. 78: 450- (2020) - [j124]Peter J. Cameron, Sayyed Heidar Jafari:
On the Connectivity and Independence Number of Power Graphs of Groups. Graphs Comb. 36(3): 895-904 (2020)
2010 – 2019
- 2019
- [j123]Peter J. Cameron, Sean Eberhard:
Association schemes for diagonal groups. Australas. J Comb. 75: 357-364 (2019) - [j122]Peter J. Cameron, David Ellis, William Raynaud:
Smallest cyclically covering subspaces of Fqn, and lower bounds in Isbell's conjecture. Eur. J. Comb. 81: 242-255 (2019) - 2018
- [j121]Peter J. Cameron, Jason Semeraro:
The Cycle Polynomial of a Permutation Group. Electron. J. Comb. 25(1): 1 (2018) - 2017
- [j120]Peter J. Cameron, Kerri Morgan:
Algebraic Properties of Chromatic Roots. Electron. J. Comb. 24(1): 1 (2017) - [j119]Ghodratollah Aalipour, Saieed Akbari, Peter J. Cameron, Reza Nikandish, Farzad Shaveisi:
On the Structure of the Power Graph and the Enhanced Power Graph of a Group. Electron. J. Comb. 24(3): 3 (2017) - [j118]Peter J. Cameron, Josephine Kusuma, Patrick Solé:
ℤ4-codes and their Gray map images as orthogonal arrays. Des. Codes Cryptogr. 84(1-2): 109-114 (2017) - 2016
- [j117]Peter J. Cameron, Ntah Ahn Dang, Søren Riis:
Guessing Games on Triangle-Free Graphs. Electron. J. Comb. 23(1): 1 (2016) - 2015
- [j116]Peter J. Cameron, Pablo Spiga:
Most switching classes with primitive automorphism groups contain graphs with trivial groups. Australas. J Comb. 62: 76-90 (2015) - [j115]Sebastian M. Cioaba, Peter J. Cameron:
A Graph Partition Problem. Am. Math. Mon. 122(10): 972-982 (2015) - [i6]Peter J. Cameron, Josephine Kusuma:
Z4-codes and their Gray map images as orthogonal arrays. CoRR abs/1510.01509 (2015) - 2014
- [j114]Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in Permutation Groups Without Memory. Chic. J. Theor. Comput. Sci. 2014 (2014) - [j113]Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in Matrix Groups Without Memory. Chic. J. Theor. Comput. Sci. 2014 (2014) - [j112]João Araújo, Peter J. Cameron:
Primitive groups synchronize non-uniform maps of extreme ranks. J. Comb. Theory B 106: 98-114 (2014) - [j111]Joshua Browning, Peter J. Cameron, Ian M. Wanless:
Bounds on the number of small Latin subsquares. J. Comb. Theory A 124: 41-56 (2014) - [i5]Peter J. Cameron, Ntah Ahn Dang, Søren Riis:
Guessing Games on Triangle-free Graphs. CoRR abs/1410.2405 (2014) - 2013
- [j110]Peter J. Cameron:
Groups with right-invariant multiorders. Australas. J Comb. 56: 187-194 (2013) - [j109]Peter J. Cameron:
Dixon's theorem and random synchronization. Discret. Math. 313(11): 1233-1236 (2013) - [j108]Peter J. Cameron, Maximilien Gadouleau, Søren Riis:
Combinatorial representations. J. Comb. Theory A 120(3): 671-682 (2013) - [j107]João Araújo, Wolfram Bentz, Peter J. Cameron:
Groups synchronizing a transformation of non-uniform kernel. Theor. Comput. Sci. 498: 1-9 (2013) - [p1]Peter J. Cameron:
The Random Graph. The Mathematics of Paul Erdős II 2013: 353-378 - [i4]Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in permutation groups without memory. CoRR abs/1310.6008 (2013) - [i3]Peter J. Cameron, Ben Fairbairn, Maximilien Gadouleau:
Computing in matrix groups without memory. CoRR abs/1310.6009 (2013) - 2012
- [j106]Peter J. Cameron, Bridget S. Webb:
Perfect countably infinite Steiner triple systems. Australas. J Comb. 54: 273-278 (2012) - [j105]Peter J. Cameron, Maximilien Gadouleau:
Remoteness of permutation codes. Eur. J. Comb. 33(6): 1273-1285 (2012) - [i2]Paola Bonizzoni, Peter J. Cameron, Gianluca Della Vedova, Alberto Leporati, Giancarlo Mauri:
A Unifying Framework to Characterize the Power of a Language to Express Relations. CoRR abs/1203.4732 (2012) - 2011
- [j104]Peter J. Cameron, Christian Krattenthaler, Thomas W. Müller:
A note on higher-dimensional magic matrices. Australas. J Comb. 50: 207-218 (2011) - [j103]Peter J. Cameron:
Research problems from the BCC22. Discret. Math. 311(13): 1074-1083 (2011) - [j102]Peter J. Cameron, Shamik Ghosh:
The power graph of a finite group. Discret. Math. 311(13): 1220-1222 (2011) - 2010
- [j101]Peter J. Cameron, Thomas Prellberg, Dudley Stark:
Asymptotic enumeration of 2-covers and line graphs. Discret. Math. 310(2): 230-240 (2010) - [j100]Peter J. Cameron:
Research Problems from the BCC21. Discret. Math. 310(2): 347-354 (2010) - [j99]Peter J. Cameron, Taoyang Wu:
The complexity of the weight problem for permutation and matrix groups. Discret. Math. 310(3): 408-416 (2010) - [j98]Peter J. Cameron, Mihyun Kang, Dudley Stark:
Random preorders and alignments. Discret. Math. 310(3): 591-603 (2010) - [j97]Peter J. Cameron, Deborah C. Lockett:
Posets, homomorphisms and homogeneity. Discret. Math. 310(3): 604-613 (2010) - [j96]Peter J. Cameron:
Permutation codes. Eur. J. Comb. 31(2): 482-490 (2010) - [j95]Peter J. Cameron:
Problems from CGCS Luminy, May 2007. Eur. J. Comb. 31(2): 644-648 (2010)
2000 – 2009
- 2009
- [j94]Christoph Buchheim, Peter J. Cameron, Taoyang Wu:
On the subgroup distance problem. Discret. Math. 309(4): 962-968 (2009) - [j93]Peter J. Cameron:
Decompositions of complete multipartite graphs. Discret. Math. 309(12): 4185-4186 (2009) - [j92]Peter J. Cameron:
A generalisation of t-designs. Discret. Math. 309(14): 4835-4842 (2009) - [j91]Taoyang Wu, Peter J. Cameron, Søren Riis:
On the guessing number of shift graphs. J. Discrete Algorithms 7(2): 220-226 (2009) - 2008
- [j90]Peter J. Cameron, Daniel Johannsen, Thomas Prellberg, Pascal Schweitzer:
Counting Defective Parking Functions. Electron. J. Comb. 15(1) (2008) - [j89]Peter J. Cameron, Daniele A. Gewurz, Francesca Merola:
Product action. Discret. Math. 308(2-3): 386-394 (2008) - [j88]Peter J. Cameron, Bill Jackson, Jason D. Rudd:
Orbit-counting polynomials for graphs and codes. Discret. Math. 308(5-6): 920-930 (2008) - [j87]Rosemary A. Bailey, Peter J. Cameron, Robert Connelly:
Sudoku, Gerechte Designs, Resolutions, Affine Space, Spreads, Reguli, and Hamming Codes. Am. Math. Mon. 115(5): 383-404 (2008) - 2007
- [j86]Peter J. Cameron, Ashley Montanaro, Michael W. Newman, Simone Severini, Andreas J. Winter:
On the Quantum Chromatic Number of a Graph. Electron. J. Comb. 14(1) (2007) - [j85]Peter J. Cameron, Koko Kalambay Kayibi:
Orbital Chromatic and Flow Roots. Comb. Probab. Comput. 16(3): 401-407 (2007) - [j84]Peter J. Cameron, A. Rudvalis:
A design and a geometry for the group Fi 22. Des. Codes Cryptogr. 44(1-3): 11-14 (2007) - [j83]Rosemary A. Bailey, Peter J. Cameron:
What is a design? How should we classify them? Des. Codes Cryptogr. 44(1-3): 223-238 (2007) - [j82]Peter J. Cameron, Taoyang Wu:
The complexity of the Weight Problem for permutation groups. Electron. Notes Discret. Math. 28: 109-116 (2007) - [j81]Peter J. Cameron, Natalia Iyudu:
Graphs of relations and Hilbert series. J. Symb. Comput. 42(11-12): 1066-1078 (2007) - 2006
- [j80]Peter J. Cameron, Anatoly M. Vershik:
Some isometry groups of the Urysohn space. Ann. Pure Appl. Log. 143(1-3): 70-78 (2006) - [j79]Peter J. Cameron, G. R. Omidi, Behruz Tayfeh-Rezaie:
3-Designs from PGL(2, q). Electron. J. Comb. 13(1) (2006) - [j78]Peter J. Cameron, Thomas Prellberg, Dudley Stark:
Asymptotics for Incidence Matrix Classes. Electron. J. Comb. 13(1) (2006) - [j77]Peter J. Cameron, Jaroslav Nesetril:
Homomorphism-Homogeneous Relational Structures. Comb. Probab. Comput. 15(1-2): 91-103 (2006) - [j76]Rosemary A. Bailey, Peter J. Cameron, Peter Dobcsányi, John P. Morgan, Leonard H. Soicher:
Designs on the web. Discret. Math. 306(23): 3014-3027 (2006) - [j75]Andries E. Brouwer, Peter J. Cameron, Willem H. Haemers, Donald A. Preece:
Self-dual, not self-polar. Discret. Math. 306(23): 3051-3053 (2006) - [j74]Peter J. Cameron, Hamid Reza Maimani, G. R. Omidi, Behruz Tayfeh-Rezaie:
3-Designs from PSL(2, q). Discret. Math. 306(23): 3063-3073 (2006) - [j73]Peter J. Cameron, Charles R. Johnson:
The number of equivalence classes of symmetric sign patterns. Discret. Math. 306(23): 3074-3077 (2006) - [j72]Peter J. Cameron:
Research problems from the 2003 IPM Workshop. Discret. Math. 306(23): 3174-3179 (2006) - [j71]Peter J. Cameron, Norbert Knarr:
Tubes in PG(3, q). Eur. J. Comb. 27(1): 114-124 (2006) - [j70]Peter J. Cameron, John Sheehan, Pablo Spiga:
Semiregular automorphisms of vertex-transitive cubic graphs. Eur. J. Comb. 27(6): 924-930 (2006) - [i1]Christoph Buchheim, Peter J. Cameron, Taoyang Wu:
On the Subgroup Distance Problem. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [j69]Peter J. Cameron:
Tribute. Discret. Math. 291(1-3): 3- (2005) - [j68]Peter J. Cameron:
The random graph has the strong small index property. Discret. Math. 291(1-3): 41-43 (2005) - [j67]Peter J. Cameron:
Partitions and permutations. Discret. Math. 291(1-3): 45-54 (2005) - [j66]Peter J. Cameron, Ian M. Wanless:
Covering radius for sets of permutations. Discret. Math. 293(1-3): 91-109 (2005) - [j65]Peter J. Cameron:
Research problems from the 19th British Combinatorial Conference. Discret. Math. 293(1-3): 313-320 (2005) - 2004
- [j64]Peter J. Cameron, Sam Tarzi:
Switching with more than two colours. Eur. J. Comb. 25(2): 169-177 (2004) - 2003
- [j63]Priscila P. Alejandro, Rosemary A. Bailey, Peter J. Cameron:
Association schemes and permutation groups. Discret. Math. 266(1-3): 47-67 (2003) - [j62]Peter J. Cameron:
Multi-letter Youden rectangles from quadratic forms. Discret. Math. 266(1-3): 143-151 (2003) - [j61]Peter J. Cameron:
Research problems from the 18th British Combinatorial Conference. Discret. Math. 266(1-3): 441-451 (2003) - [j60]Peter J. Cameron:
Random strongly regular graphs? Discret. Math. 273(1-3): 103-114 (2003) - [j59]Peter J. Cameron, Cheng Yeaw Ku:
Intersecting families of permutations. Eur. J. Comb. 24(7): 881-890 (2003) - 2002
- [j58]Peter J. Cameron:
Cycle Index, Weight Enumerator, and Tutte Polynomial. Electron. J. Comb. 9(1) (2002) - [j57]Peter J. Cameron, Dudley Stark:
A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property. Electron. J. Comb. 9(1) (2002) - [j56]Peter J. Cameron:
Homogeneous Permutations. Electron. J. Comb. 9(2) (2002) - [j55]Anthony Bonato, Peter J. Cameron, Dejan Delic, Stéphan Thomassé:
Generalized Pigeonhole Properties of Graphs and Oriented Graphs*1. Eur. J. Comb. 23(3): 257-274 (2002) - 2001
- [j54]Peter J. Cameron:
Random strongly regular graphs? Electron. Notes Discret. Math. 10: 54-63 (2001) - [j53]Peter J. Cameron, Wilfrid Hodges:
Some Combinatorics of Imperfect Information. J. Symb. Log. 66(2): 673-684 (2001) - 2000
- [j52]László Babai, Peter J. Cameron:
Automorphisms and Enumeration of Switching Classes of Tournaments. Electron. J. Comb. 7 (2000) - [j51]Jason P. Bell, Edward A. Bender, Peter J. Cameron, L. Bruce Richmond:
Asymptotics for the Probability of Connectedness and the Distribution of Number of Components. Electron. J. Comb. 7 (2000) - [j50]Peter J. Cameron:
Some counting problems related to permutation groups. Discret. Math. 225(1-3): 77-92 (2000) - [j49]Peter J. Cameron:
Homogeneous Cayley Objects. Eur. J. Comb. 21(6): 745-760 (2000) - [j48]Peter J. Cameron:
Problems on Discrete Metric Spaces. Eur. J. Comb. 21(6): 831-838 (2000)
1990 – 1999
- 1999
- [j47]Peter J. Cameron:
An extremal problem related to biplanes. Australas. J Comb. 20: 97-100 (1999) - [j46]Peter J. Cameron:
SGDs with doubly transitive automorphism group. J. Graph Theory 32(3): 229-233 (1999) - 1998
- [j45]Neil J. Calkin, Peter J. Cameron:
Almost Odd Random Sum-Free Sets. Comb. Probab. Comput. 7(1): 27-32 (1998) - [j44]Peter J. Cameron:
A census of infinite distance-transitive graphs. Discret. Math. 192(1-3): 11-26 (1998) - 1997
- [j43]Peter J. Cameron:
On the probability of connectedness. Discret. Math. 167-168: 175-187 (1997) - 1996
- [j42]Peter J. Cameron:
Stories about Groups and Sequences. Des. Codes Cryptogr. 8(1-2): 109-133 (1996) - [j41]Peter J. Cameron:
Metric and Topological Aspects of the Symmetric Group of Countable Degree. Eur. J. Comb. 17(2-3): 135-142 (1996) - 1995
- [j40]Peter J. Cameron:
Counting Two-graphs Related to Trees. Electron. J. Comb. 2 (1995) - [j39]Peter J. Cameron, Dmitry Fon-Der-Flaass:
Bases for permutation groups and matroids. Eur. J. Comb. 16(6): 537-544 (1995) - [j38]Peter J. Cameron, Dmitry Fon-Der-Flaass:
Orbits of antichains revisited. Eur. J. Comb. 16(6): 545-554 (1995) - 1994
- [j37]Peter J. Cameron:
An orbit theorem for Steiner triple systems. Discret. Math. 125(1-3): 97-100 (1994) - [j36]Peter J. Cameron:
Two-graphs and trees. Discret. Math. 127(1-3): 63-74 (1994) - [j35]Peter J. Cameron:
Infinite linear spaces. Discret. Math. 129(1-3): 29-41 (1994) - 1993
- [j34]Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald:
Infinite highly arc transitive digraphs and universal covering digraphs. Comb. 13(4): 377-396 (1993) - [j33]Peter J. Cameron, Cleide Martins:
A Theorem on Reconstruction of Random Graphs. Comb. Probab. Comput. 2: 1-9 (1993) - [j32]Peter J. Cameron, William M. Kantor:
Random Permutations: Some Group-Theoretic Aspects. Comb. Probab. Comput. 2: 257-262 (1993) - [j31]Peter J. Cameron, Cheryl E. Praeger:
Block-transitive t-designs I: point-imprimitive designs. Discret. Math. 118(1-3): 33-43 (1993) - 1992
- [j30]Peter J. Cameron:
Almost all quasigroups have rank 2. Discret. Math. 106-107: 111-115 (1992) - [j29]Peter J. Cameron, Arjeh M. Cohen:
On the number of fixed point free elements in a permutation group. Discret. Math. 106-107: 135-138 (1992) - [j28]Peter J. Cameron:
Infinite geometric groups of rank 4. Eur. J. Comb. 13(2): 87-88 (1992) - 1991
- [j27]Peter J. Cameron:
Several 2-(46, 6, 3) designs. Discret. Math. 87(1): 89-90 (1991) - [j26]Peter J. Cameron:
The age of a relational structure. Discret. Math. 95(1-3): 49-67 (1991) - [j25]Peter J. Cameron:
Covers of graphs and EGQs. Discret. Math. 97(1-3): 83-92 (1991) - [j24]Peter J. Cameron, John J. Cannon:
Fast Recognition of Doubly Transitive Groups. J. Symb. Comput. 12(4/5): 459-474 (1991) - 1990
- [j23]Peter J. Cameron, P. H. Fisher:
Small Extended Generalized Quadrangles. Eur. J. Comb. 11(5): 403-413 (1990)
1980 – 1989
- 1989
- [j22]Peter J. Cameron:
Some sequences of integers. Discret. Math. 75(1-3): 89-102 (1989) - [j21]Peter J. Cameron, Peter Frankl, William M. Kantor:
Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements. Eur. J. Comb. 10(2): 149-160 (1989) - 1988
- [j20]Peter J. Cameron, Michel Deza, Peter Frankl:
Intersection theorems in permutation groups. Comb. 8(3): 249-260 (1988) - 1987
- [j19]Peter J. Cameron:
Some Permutation Representations of a Free Group. Eur. J. Comb. 8(3): 257-260 (1987) - [j18]Peter J. Cameron:
Digraphs Admitting Sharply Edge-transitive Automorphism Groups. Eur. J. Comb. 8(4): 357-365 (1987) - [j17]Peter J. Cameron, Amanda G. Chetwynd, John J. Watkins:
Decomposition of snarks. J. Graph Theory 11(1): 13-19 (1987) - 1986
- [j16]Peter J. Cameron:
Regular orbits of permutation groups on the power set. Discret. Math. 62(3): 307-309 (1986) - [j15]Peter J. Cameron, Albert L. Wells Jr.:
Signatures and signed switching classes. J. Comb. Theory B 40(3): 344-361 (1986) - 1985
- [j14]Peter J. Cameron:
Cyclic automorphisms of a countable graph and random sum-free sets. Graphs Comb. 1(1): 129-135 (1985) - [j13]Peter J. Cameron, H. D. Macpherson:
Rank three permutation groups with rank three subconstituents. J. Comb. Theory B 39(1): 1-16 (1985) - 1983
- [j12]Peter J. Cameron, Cheryl E. Praeger:
On 2-arc transitive graphs of girth 4. J. Comb. Theory B 35(1): 1-11 (1983) - 1982
- [j11]Peter J. Cameron:
There are only finitely many finite distance-transitive graphs of given valency greater than two. Comb. 2(1): 9-13 (1982) - [j10]Peter J. Cameron, Jack H. van Lint:
On the Partial Geometry pg(6, 6, 2). J. Comb. Theory A 32(2): 252-255 (1982) - 1981
- [j9]Peter J. Cameron:
Normal subgroups of infinite multiply transitive permutation groups. Comb. 1(4): 343-347 (1981) - [j8]Eiichi Bannai, Peter J. Cameron, Jeff Kahn:
Nonexistence of certain distance-transitive digraphs. J. Comb. Theory B 31(3): 105-110 (1981) - 1980
- [j7]Peter J. Cameron:
On Graphs with Given Automorphism Group. Eur. J. Comb. 1(2): 91-96 (1980) - [j6]Peter J. Cameron:
6-Transitive graphs. J. Comb. Theory B 28(2): 168-179 (1980) - [j5]Peter J. Cameron:
A note on generalized line graphs. J. Graph Theory 4(2): 243-245 (1980)
1970 – 1979
- 1978
- [j4]Peter J. Cameron, William M. Kantor:
Rank 3 Groups and Biplanes. J. Comb. Theory A 24(1): 1-23 (1978) - 1977
- [j3]Peter J. Cameron:
Automorphisms and cohomology of switching classes. J. Comb. Theory B 22(3): 297-298 (1977) - 1976
- [j2]Peter J. Cameron:
Embedding Edge-Colored Complete Graphs in Binary Affine Spaces. J. Comb. Theory A 21(2): 203-215 (1976) - 1973
- [j1]Peter J. Cameron:
Extending Symmetric Designs. J. Comb. Theory A 14(2): 215-220 (1973)
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 2025-03-04 01:58 CET 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:
