Professor of Combinatorial Mathematics
Research Interests: Combinatorics, graph theory, algorithms
Publications
Critically partitionable graphs II
– Discrete Mathematics
(1982)
41,
67
(doi: 10.1016/0012-365x(82)90083-8)
On finite ramsey numbers
– European Journal of Combinatorics
(1982)
3,
263
Contributions to the theory of domination, independence and irredundance in graphs
– Discrete Mathematics
(1981)
33,
249
(doi: 10.1016/0012-365x(81)90268-5)
Graphs which contain all small graphs
– European Journal of Combinatorics
(1981)
2,
13
Dense neighbourhoods and Turán's theorem
– Journal of Combinatorial Theory, Series B
(1981)
31,
111
Optimal multi-message broadcasting in complete
graphs
– Utilitas Mathematica
(1980)
18,
181
An algorithm for the most economic
link addition in a tree communications network
– Information Processing Letters
(1979)
9,
171
Critically partitionable graphs, I
– Journal of Combinatorial Theory, Series B
(1979)
27,
254
(doi: 10.1016/0095-8956(79)90017-0)
Hamiltonian cycles and uniquely edge colourable graphs
– Annals of Discrete Mathematics
(1978)
3,
259
- <
- 10 of 10