D. J. A. Welsh

13 papers Journal 13
YearRankTypeTitle / Venue / Authors
2012 J jnl
Corrigendum to "A linking polynomial of two matroids" [Adv. in Appl. Math. 32 (1-2) (2004) 391-419].
Adv. Appl. Math.
D. J. A. Welsh, Koko K. Kayibi
2004 J jnl
A linking polynomial of two matroids.
Adv. Appl. Math.
D. J. A. Welsh, Koko K. Kayibi
2000 J jnl
Knot graphs.
J. Graph Theory
Steven D. Noble, D. J. A. Welsh
1994 J jnl
Randomised Approximation in the Tutte Plane.
Comb. Probab. Comput.
D. J. A. Welsh
1994 J jnl
The computational complexity of knot and matroid polynomials.
Discret. Math.
D. J. A. Welsh
1994 J jnl
The random cluster process.
Discret. Math.
D. J. A. Welsh
1989 J jnl
A randomised 3-colouring algorithm.
Discret. Math.
A. D. Petford, D. J. A. Welsh
1983 J jnl
Randomised algorithms.
Discret. Appl. Math.
D. J. A. Welsh
1982 J jnl
Tangential 1-blocks over GF(3).
Discret. Math.
P. N. Walton, D. J. A. Welsh
1973 J jnl
A greedy algorithm for solving a certain class of linear programmes.
Math. Program.
F. D. J. Dunstan, D. J. A. Welsh
1972 J jnl
On the automorphism group of a matroid.
Discret. Math.
Frank Harary, M. J. Piff, D. J. A. Welsh
1967 J jnl
An upper bound for the chromatic number of a graph and its application to timetabling problems.
Comput. J.
D. J. A. Welsh, M. B. Powell
1966 J jnl
Letter to the Editor - Super-Critical Arcs of a PERT Network.
Oper. Res.
D. J. A. Welsh