Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Vertigan, D. L.
and
Welsh, D. J. A.
1992.
The Computational Complexity of the Tutte Plane: the Bipartite Case.
Combinatorics, Probability and Computing,
Vol. 1,
Issue. 2,
p.
181.
Oxley, J.G.
and
Welsh, D.J.A.
1992.
Tutte polynomials computable in polynomial time.
Discrete Mathematics,
Vol. 109,
Issue. 1-3,
p.
185.
Jaeger, François
1992.
A new invariant of plane bipartite cubic graphs.
Discrete Mathematics,
Vol. 101,
Issue. 1-3,
p.
149.
Millett, Kenneth C.
1992.
Topological Aspects of the Dynamics of Fluids and Plasmas.
p.
29.
Schwärzler, W.
and
Welsh, D. J. A.
1993.
Knots, matroids and the Ising model.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 113,
Issue. 1,
p.
107.
Welsh, D J A
1993.
Percolation in the random cluster process and Q-state Potts model.
Journal of Physics A: Mathematical and General,
Vol. 26,
Issue. 11,
p.
2471.
Welsh, Dominic J.A.
1993.
Quo Vadis, Graph Theory? - A Source Book for Challenges and Directions.
Vol. 55,
Issue. ,
p.
159.
Farr, G. E.
1993.
A generalization of the Whitney rank generating function.
Mathematical Proceedings of the Cambridge Philosophical Society,
Vol. 113,
Issue. 2,
p.
267.
Jaeger, François
1993.
Plane graphs and link invariants.
Discrete Mathematics,
Vol. 114,
Issue. 1-3,
p.
253.
Welsh, D.J.A.
1994.
The random cluster process.
Discrete Mathematics,
Vol. 136,
Issue. 1-3,
p.
373.
Welsh, D.J.A.
1994.
The computational complexity of knot and matroid polynomials.
Discrete Mathematics,
Vol. 124,
Issue. 1-3,
p.
251.
Alon, N.
Frieze, A.
and
Welsh, D.
1994.
Polynomial time randomised approximation schemes for the Tutte polynomial of dense graphs.
p.
24.
Annan, J. D.
1994.
A Randomised Approximation Algorithm for Counting the Number of Forests in Dense Graphs.
Combinatorics, Probability and Computing,
Vol. 3,
Issue. 3,
p.
273.
Welsh, D. J. A.
1994.
Randomised Approximation in the Tutte Plane.
Combinatorics, Probability and Computing,
Vol. 3,
Issue. 1,
p.
137.
Alon, Noga
Frieze, Alan
and
Welsh, Dominic
1995.
Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case.
Random Structures & Algorithms,
Vol. 6,
Issue. 4,
p.
459.
Bartels, J. Eric
and
Welsh, Dominic J. A.
1995.
Integer Programming and Combinatorial Optimization.
Vol. 920,
Issue. ,
p.
373.
Colbourn, Charles J.
Provan, J. Scott
and
Vertigan, Dirk
1995.
The complexity of computing the tutte polynomial on transversal matroids.
Combinatorica,
Vol. 15,
Issue. 1,
p.
1.
Jerrum, Mark
1995.
Proceedings of the International Congress of Mathematicians.
p.
1407.
Welsh, Dominic
1995.
Discrete Probability and Algorithms.
Vol. 72,
Issue. ,
p.
133.
Mihail, M.
and
Winkler, P.
1996.
On the number of Eulerian orientations of a graph.
Algorithmica,
Vol. 16,
Issue. 4-5,
p.
402.