D. J. A. Welsh - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2012

Corrigendum to "A linking polynomial of two matroids" [Adv. in Appl. Math. 32 (1-2) (2004) 391-419]D. J. A. Welsh, Koko K. Kayibi. aam, 49(1):78-79, 2012. [doi]

2004

A linking polynomial of two matroidsD. J. A. Welsh, Koko K. Kayibi. aam, 32(1-2):391-419, 2004. [doi]

2000

Knot graphsS. D. Noble, D. J. A. Welsh. jgt, 34(1):100-111, 2000. [doi]

1994

Randomised Approximation in the Tutte PlaneD. J. A. Welsh. cpc, 3:137-143, 1994.

The computational complexity of knot and matroid polynomialsD. J. A. Welsh. DM, 124(1-3):251-269, 1994. [doi]

The random cluster processD. J. A. Welsh. DM, 136(1-3):373-390, 1994. [doi]

1989

A randomised 3-colouring algorithmA. D. Petford, D. J. A. Welsh. DM, 74(1-2):253-261, 1989. [doi]

1983

Randomised algorithmsD. J. A. Welsh. DAM, 5(1):133-145, 1983. [doi]

1982

Tangential 1-blocks over GF(3)P. N. Walton, D. J. A. Welsh. DM, 40(2-3):319-320, 1982. [doi]

1973

A greedy algorithm for solving a certain class of linear programmesF. D. J. Dunstan, D. J. A. Welsh. mp, 5(1):338-353, 1973. [doi]

1972

On the automorphism group of a matroidF. Harary, M. J. Piff, D. J. A. Welsh. DM, 2(2):163-171, 1972. [doi]

1967

An upper bound for the chromatic number of a graph and its application to timetabling problemsD. J. A. Welsh, M. B. Powell. cj, 10(1):85-86, 1967. [doi]

1966

Letter to the Editor - Super-Critical Arcs of a PERT NetworkD. J. A. Welsh. ior, 14(1):173-174, 1966. [doi]

Sign in or sign up to see more results.

runs on WebDSL