Tutte Polynomial

The Tutte Polynomial is a graph and matroid invariant polynomial that generalizes the number of spanning trees, chromatic polynomial, and reliability polynomial by enumerating the subgraphs or subsets of elements according to their rank and nullity across all subsets of the ground set.

278

Publications

11.2K

Citations

307

Authors

231

Institutions

Publications per year

2017–2026

18

Authors

307

  1. DW
    Dominic Welsh

    University of Oxford, United Kingdom

    10 publications · 1K citations

    10

    h-index

  2. CM
    Criel Merino

    Universidad Nacional Autónoma de México, Mexico

    8 publications · 312 citations

    8

    h-index

  3. JA
    Joanna A. Ellis-Monaghan

    Saint Michael's College, United States

    7 publications · 192 citations

    7

    h-index

  4. ML
    Michel Las Vergnas

    Sorbonne Université, France

    7 publications · 222 citations

    7

    h-index

  5. MN
    Marc Noy

    Universitat Politècnica de Catalunya, Spain

    7 publications · 263 citations

    7

    h-index

1–5 of 307

Venues

  1. Journal of Combinatorial Theory Series B

    26 publications · 972 citations

    18

    h-index

  2. Discrete Mathematics

    25 publications · 669 citations

    16

    h-index

  3. Combinatorics Probability Computing

    15 publications · 657 citations

    12

    h-index

  4. The Electronic Journal of Combinatorics

    10 publications · 287 citations

    10

    h-index

  5. Advances in Applied Mathematics

    11 publications · 282 citations

    10

    h-index

1–5