Fetching the paper…
Reading the bibliography…
In this survey of graph polynomials, we emphasize the Tutte polynomial and a selection of closely related graph polynomials.
Birkhoff, G.D.: A determinant formula for the number of ways of coloring a map. Annals of Mathematics, 14
1912
Earlier work this paper cites.
Whitney, H.: A Logical Expansion in Mathematics. Bull. Amer. Math. Soc., 38
1932
Earlier work this paper cites.
Pauling, L.: The structure and entropy of ice and of other crystals with some randomness of atomic arrangement. J. Am. Chem. Soc., 57
1935
Earlier work this paper cites.
Tutte, W. T.: A ring in graph theory. Proc. Cambridge Phil. Soc., 43
1947
Earlier work this paper cites.
Tutte, W. T.: An Algebraic Theory of Graphs, PhD thesis, University of Cambridge (1948)
1948
Earlier work this paper cites.
Tutte, W. T.: A contribution to the theory of chromatic polynomials. Can. J. Math., 6
1954
Earlier work this paper cites.
Kasteleyn, P.W.: The statistics of dimers on a lattice. Physica, 27
1961
Earlier work this paper cites.
Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10
1965
Earlier work this paper cites.
Crapo, H. H.: A higher invariant for matroids. J. Combin. Theory, 2
1967
Earlier work this paper cites.
Lieb, E. H.: Residual entropy of square ice. Phys. Rev., 162
1967
Earlier work this paper cites.
Tutte, W. T.: On dichromatic polynomials. J. Combin. Theory, 2
1967
Earlier work this paper cites.
Read, R. C.: An introduction to chromatic polynomials. J. Combin. Theory Ser. B, 4
1968
Earlier work this paper cites.
Crapo, H. H.: The Tutte polynomial. Aeq. Math., 3
1969
Earlier work this paper cites.
Brylawski, T.: A combinatorial model for series-parallel networks. Trans. Amer. Math. Soc., 154
1971
Earlier work this paper cites.
Brylawski, T.: A Decomposition for Combinatorial Geometries. Trans. Amer. Math. Soc., 171
1972
Earlier work this paper cites.
Stanley, R.: Acyclic orientations of graphs. Discrete Mathematics, 5
1973
Earlier work this paper cites.
Seymour, P. D., Welsh, D. J. A.: Combinatorial applications of an inequality of statistical mechanics. Math. Proc. Cambridge Philos. Soc., 77
1975
Earlier work this paper cites.
Zaslavsky, T.: Facing up to arrangements: Face-count formulas for partitions of spaces by hyperplanes. Mem. Amer. Math. Soc., 154
1975
Earlier work this paper cites.
Jaeger, F.: On nowhere-zero flows in multigraphs. In: Nash-Williams, C. St. J. A., Sheehan, J. (eds) Proceedings of the Fifth British Combinatorial Conference. Utilitas Math., Winnipeg (1976)
1976
Earlier work this paper cites.
Las Vergnas, M.: Acyclic and totally cyclic orientations of combinatorial geometries. Discrete Mathematics, 20
1977
Earlier work this paper cites.
Martin, P.: Enumérations eulériennes dans le multigraphs et invariants de Tutte-Gröthendieck. PhD Thesis, Grenoble (1977)
1977
Earlier work this paper cites.
Martin, P.: Remarkable valuation of the dichromatic polynomial of planar multigraphs. J. Combin. Theory Ser. B, 24
1978
Earlier work this paper cites.
Read, R. C., Rosenstiehl, P.: On the principal edge tripartition of a graph. Ann. Discrete Math., 3
1978
Earlier work this paper cites.
Garey, M. R., Johnson, D. S.: Computers and Intractability– A guide to the theory of N P NP -completeness. W. H. Freeman, San Francisco (1979)
1979
Earlier work this paper cites.
Oxley, J., Welsh D. J. A.: The Tutte Polynomial and Percolation. In: Bondy, J. A., Murty U. S. R. (eds) Graph Theory and Related Topics. Academic Press, London (1979)
1979
Earlier work this paper cites.
Tutte, W. T.: All the kings horses. In: Bondy, J. A., Murty U. S. R. (eds) Graph Theory and Related Topics. Academic Press, London (1979)
1979
Earlier work this paper cites.
Provan, J. S., Billera, L. J.: Decompositions of simplicial complexes related to diameters of convex polyhedra. Math. Oper. Res., 5
1980
Earlier work this paper cites.
Stanley, R.: Decomposition of rational polytopes. Annals of Discrete Mathematics, 6
1980
Earlier work this paper cites.
Kleitman, D. J., Winston, K. J.: Forests and score vectors. Combinatorica, 1
1981
Earlier work this paper cites.
Seymour, P. D.: Nowhere-zero 6 6 -flows. J. Combin. Theory Ser. B, 30
1981
Earlier work this paper cites.
Brylawski, T.: The Tutte polynomial, Part 1: General Theory. In: Barlotti, A. (ed) Matroid Theory and Its Applications. Proceedings of the Third International Mathematical Summer Center (C.I.M.E. 1980) (1982)
1982
Earlier work this paper cites.
Oxley, J.: On Crapos beta invariant for matroids. Stud. Appl. Math. 66
1982
Earlier work this paper cites.
Green, C., Zaslavsky, T.: On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions and orientations of graphs. Trans. Amer. Math. Soc., 280
1983
Earlier work this paper cites.
Las Vergnas, M.: The Tutte polynomial of a morphism of matroids II. Activities of orientations. In: Bondy, J. A., Murty, U. S. R. (eds) Progress in Graph Theory, Proceedings of Waterloo Silver Jubilee Combinatorial Conference 1982. Academic Press, Toronto (1984)
1984
Earlier work this paper cites.
Robertson, N., Seymour, P. D.: Graph minors. I. Excluding a forest. J. Combin. Theory Ser. B, 35
1984
Earlier work this paper cites.
Robertson, N., Seymour, P. D.: Graph minors. III. Planar tree-width. J. Combin. Theory Ser. B, 36
1984
Earlier work this paper cites.
Tutte, W. T.: Graph Theory. Cambridge University Press, Cambridge (1984)
1984
Earlier work this paper cites.
Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. J Algorithms, 7
1986
Earlier work this paper cites.
Jerrum, M. R.: 2-dimensional monomer-dimer systems are computationally intractable. J. Statist. Phys. 48
1987
Earlier work this paper cites.
Thistlethwaite, M. B.: A spanning tree expansion of the Jones polynomial. Topology, 26
1987
Cited alongside, same era.
Zaslavsky, T.: The Möbius function and the characteristic polynomial.In: White, N. (ed) Combinatorial Geometries, Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1987)
1987
Cited alongside, same era.
Bak, P., Tang, C., Wiesenfeld K.: Self-organized criticality. Phys. Rev. A, 38
1988
Cited alongside, same era.
Jaeger, F.: Nowhere-zero flow problems. In: Beineke, L. W., Wilson, R. J. (eds) Selected Topics in Graph Theory 3. Academic Press, New York (1988)
1988
Cited alongside, same era.
Las Vergnas, M.: On the evaluation at (3,3) of the Tutte polynomial of a graph. J. Combin. Theory Ser. B, 44
1988
Cited alongside, same era.
Welsh, D. J. A.: The Tutte Polynomial, in Statistical physics methods in discrete probability, combinatorics, and theoretical computer science. Random Structures Algorithms, 15
1999
Later among the works it cites.
Diestel, R.: Graph Theory, Graduate Texts in Mathematics. Springer, New York (2000)
2000
Later among the works it cites.
Traldi, L.: Series and parallel reductions for the Tutte polynomial. Discrete Mathematics, 220
2000
Later among the works it cites.
Welsh, D. J. A., Merino, C.: The Potts model and the Tutte polynomial. Journal of Mathematical Physics, 41
2000
Later among the works it cites.
Aigner, M., Ziegler, G.M.: Proofs from the Book. Springer-Verlag, Berlin Heidelberg New York (2001)
2001
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dhar, D.: Self-organized critical state of sandpile automaton models. Phys. Rev. lett., 64
1990
Cited alongside, same era.
Jaeger, F., Vertigan, D. L., Welsh, D. J. A.: On the computational complexity of the Jones and Tutte polynomials. Math. Proc. Camb. Phil. Soc., 108
1990
Cited alongside, same era.
Yetter, D.: On graph invariants given by linear recurrence relations. J. Combin. Theory Ser. B, 48
1990
Cited alongside, same era.
Read, R. C., Royle, G.: Chromatic roots of families of graphs. In: Alavi, Y. et al. (eds) Graph Theory, Combinatorics, and Applications. Wiley, New York (1991)
1991
Cited alongside, same era.
Björner, A.: Homology and shellability of matroids and geometric lattices. In: White, N. (ed) Matroid Applications, Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1992)
1992
Cited alongside, same era.
Brylawski, T., Oxley, J.: The Tutte Polynomial and its Applications. In: White, N. (ed) Matroid Applications, Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1992)
1992
Cited alongside, same era.
Vertigan, D. L., Welsh, D. J. A.: The computational complexity of the Tutte plane: the bipartite case. Comb. Probab. Comput., 1
1992
Cited alongside, same era.
Brown, J. I., Hickman, C. A., Sokal, A. D., Wagner, D. G.: On the chromatic roots of generalized theta graphs. J. Combin. Theory Ser. B, 83
2001
Later among the works it cites.
Chang, S. C., Shrock, R.: Exact Potts model partition functions on wider arbitrary-length strips of the square lattice. Physica A, 296
2001
Later among the works it cites.
Lass, B.: Orientations acycliques et le polynome chromatique. European J. Combin., 22
2001
Later among the works it cites.
McKee, T. A.: Recognizing dual-chordal graphs. Congr. Numer., 150
2001
Later among the works it cites.
Merino, C.: The chip firing game and matroid complex. Discrete Mathematics and Theoretical Computer Science, Proceedings vol. AA
2001
Later among the works it cites.
Merino, C., de Mier, A., Noy, M.: Irreducibility of the Tutte polynomial of a connected matroid. J. Combin. Theory Ser. B, 83
2001
Later among the works it cites.
Shrock, R.: Chromatic polynomials and their zeros and asymptotic limits for families of graphs. Discrete Math., 231
2001
Later among the works it cites.
Sokal, A. D.: A personal list of unsolved problems concerning lattice gases and antiferromagnetic Potts models. Markov Process and Related Fields, 7
2001
Later among the works it cites.
Sokal, A. D.: Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions. Combin. Probab. Comput., 10
2001
Later among the works it cites.
Jackson, B.: Zeros of chromatic and flow polynomials of graphs. J. Geom., 76
2003
Later among the works it cites.
Procacci, A., Scoppola, B., Gerasimov, V.: Potts model on infinite graphs and the limit of chromatic polynomials. Communications in Mathematical Physics, 235
2003
Later among the works it cites.
Chang, S. C., Jacobsen, J., Salas, J., Shrock, R.: Exact Potts model partition functions for strips of the triangular lattice. J. Stat. Phys., 114
2004
Later among the works it cites.
Choe, Y. B., Oxley, J. G., Sokal, A. D., Wagner, D. G.: Homogeneous multivariate polynomials with the half-plane property. Adv. in Appl. Math., 32
2004
Later among the works it cites.
Dong, F. M.; Koh, K. M.: On upper bounds for real roots of chromatic polynomials. Disc. Math. 282
2004
Later among the works it cites.
Dong, F. M. The largest non-integer zero of chromatic polynomials of graphs with fixed order. Disc. Math. 282
2004
Later among the works it cites.
Ellis-Monaghan, J.: Identities for the circuit partition polynomials, with applications to the diagonal Tutte polynomial. Advances in Applied Mathematics, 32
2004
Later among the works it cites.
Ellis-Monaghan, J.: Exploring the Tutte-Martin connection. Discrete Mathematics, 281
2004
Later among the works it cites.
Sokal, A. D.: Chromatic roots are dense in the whole complex plane. Combin. Probab. Comput., 13
2004
Later among the works it cites.
Tutte, W. T.: Graph-polynomials. Special issue on the Tutte polynomial, Adv. in Appl. Math., 32
2004
Later among the works it cites.
Dong, F. M., Koh, K. M., Teo, K. L.: Chromatic polynomials and chromaticity of graphs. World Scientific, Hackensack, NJ, (2005)
2005
Later among the works it cites.
Gioan, E., Las Vergnas, M.: Activity preserving bijections between spanning trees and orientations in graphs. Discrete Math., 298
2005
Later among the works it cites.
Makowsky, J. A.: Colored Tutte polynomials and Kauffman brackets for graphs of bounded tree width. Discrete Appl. Math., 145
2005
Later among the works it cites.
Borgs, C.: Absence of zeros for the chromatic polynomial on bounded degree graphs. Combin. Probab. Comput., 15
2006
Later among the works it cites.
Farr, G. E.: The complexity of counting colourings of subgraphs of the grid. Comb. Probab. Comput., 15
2006
Later among the works it cites.
Makowsky, J. A., Rotics, U., Averbouch, I., Godlin, B.: Computing graph polynomials on graphs of bounded clique-width. In: Lecture Notes in Computer Science 4271. Springer-Verlag, New York (2006)
2006
Later among the works it cites.
Oum, S., Seymour, P. D.: Approximating clique-width and branch-width. J. Combin. Theory Ser. B, 96
2006
Later among the works it cites.
Traldi, L.: On the colored Tutte polynomial of a graph of bounded treewidth. Discrete Applied Mathematics, 154
2006
Later among the works it cites.
Dong, F. M.; Koh, K. M.: Bounds for the coefficients of flow polynomials. J. Combin. Theory Ser. B, 97
2007
Later among the works it cites.
Farr, G. E.: Tutte-Whitney polynomials: some history and generalizations. In: Grimmett, G. R., McDiarmid C. J. H.(eds) Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh. Oxford University Press, Oxford (2007)
2007
Later among the works it cites.
Goldberg, L. A., Jerrum M. R.: Inapproximability of the Tutte polynomial. In STOC ’07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. ACM Press, New York (2007)
2007
Later among the works it cites.
Jackson, B.: Zero-free intervals for flow polynomials of near-cubic graphs. Comb. Probab. Comput., 16
2007
Later among the works it cites.
Las Vergnas, M.: The Tutte polynomial of a morphism of matroids V. Derivatives as generating functions. Preprint (2007)
2007
Later among the works it cites.
Noble, S. D.: The complexity of graph polynomials. In: Grimmett, G. R., McDiarmid C. J. H.(eds) Combinatorics, Complexity, and Chance: A Tribute to Dominic Welsh. Oxford University Press, Oxford (2007)
2007
Later among the works it cites.