Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

C. R. J. Clapham

> Home > Persons

Person information

affiliation: University of Aberdeen, UK

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Journal Articles

see FAQ

What is the meaning of the colors in the publication lists?

1993
[j10]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/ClaphamS93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/ClaphamS93
C. R. J. Clapham, J. Sheehan:
All trees are 1-embeddable and all except stars are 2-embeddable. Discret. Math. 120(1-3): 253-259 (1993)
1990
[j9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/Clapham90
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Clapham90
C. R. J. Clapham:
Graphs self-complementary in K_n - e. Discret. Math. 81(3): 229-235 (1990)
1989
[j8]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/ClaphamEHMS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/ClaphamEHMS89
C. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan:
The ramsey number of k₅ - e. J. Graph Theory 13(1): 7-15 (1989)
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/ClaphamFS89
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/ClaphamFS89
C. R. J. Clapham, A. Flockhart, J. Sheehan:
Graphs without four-cycles. J. Graph Theory 13(1): 29-47 (1989)
1986
[j6]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/Clapham86
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Clapham86
C. R. J. Clapham:
Universal tilings and universal (0, 1)-matrices. Discret. Math. 58(1): 87-92 (1986)
1985
[j5]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/Clapham85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Clapham85
C. R. J. Clapham:
The bipartite tournament associated with a fabric. Discret. Math. 57(1-2): 195-197 (1985)
[j4]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jct/Clapham85
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jct/Clapham85
C. R. J. Clapham:
When a three-way fabric hangs together. J. Comb. Theory B 38(2): 190 (1985)
1979
[j3]
- view
  authority control:
- export record
  dblp key:
  - journals/jgt/Clapham79
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgt/Clapham79
C. R. J. Clapham:
A class of self-complementary graphs and lower bounds of some ramsey numbers. J. Graph Theory 3(3): 287-289 (1979)
1975
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/Clapham75
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Clapham75
C. R. J. Clapham:
Hamiltonian arcs in infinite self-complementary graphs. Discret. Math. 13(4): 307-314 (1975)
1974
[j1]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/Clapham74
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Clapham74
C. R. J. Clapham:
Hamiltonian arcs in self-complementary graphs. Discret. Math. 8(3): 251-255 (1974)

a service of

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.