Chromatic polynomials of homeomorphism classes of graphs
Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould
The Tutte polynomial for homeomorphism classes of graphs
Discrete Mathematics
Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
Combinatorics, Probability and Computing
Chromatic Roots are Dense in the Whole Complex Plane
Combinatorics, Probability and Computing
Parametrized Tutte Polynomials of Graphs and Matroids
Combinatorics, Probability and Computing
Knot invariants and the Bollobás-Riordan polynomial of embedded graphs
European Journal of Combinatorics
Hi-index | 0.05 |
Let G be a graph obtained from a graph G with no loops or coloops by replacing each edge e = uw of G by a connected graph He that has only the vertices u and w in common with the rest of G. Two mutually dual formulas are proved for the Tutte polynomial of G in terms of parameters of the graphs He and (in the one case) flow polynomials of subgraphs of G or (in the other case) tension polynomials of contractions of G. This generalizes the results of Read and Whitehead on homeomorphism classes of graphs.