C. R. J. Clapham

According to our database, C. R. J. Clapham authored at least 10 papers between 1974 and 1993.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

1993

All trees are 1-embeddable and all except stars are 2-embeddable.

C. R. J. Clapham, J. Sheehan

Discret. Math., 1993

1990

Graphs self-complementary in K_n - e.

C. R. J. Clapham

Discret. Math., 1990

1989

Graphs without four-cycles.

C. R. J. Clapham, A. Flockhart, J. Sheehan

J. Graph Theory, 1989

The ramsey number of k₅ - e.

C. R. J. Clapham, Geoffrey Exoo, Heiko Harborth, Ingrid Mengersen, J. Sheehan

J. Graph Theory, 1989

1986

Universal tilings and universal (0, 1)-matrices.

C. R. J. Clapham

Discret. Math., 1986

1985

When a three-way fabric hangs together.

C. R. J. Clapham

J. Comb. Theory, Ser. B, 1985

The bipartite tournament associated with a fabric.

C. R. J. Clapham

Discret. Math., 1985

1979

A class of self-complementary graphs and lower bounds of some ramsey numbers.

C. R. J. Clapham

J. Graph Theory, 1979

1975

Hamiltonian arcs in infinite self-complementary graphs.

C. R. J. Clapham

Discret. Math., 1975

1974

Hamiltonian arcs in self-complementary graphs.

C. R. J. Clapham

Discret. Math., 1974