Skip to search formSkip to main contentSkip to account menu

Tutte polynomial

Known as: Tutte-Whitney polynomial, Corank-nullity polynomial, Dichromatic polynomial 
The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a polynomial in two variables which plays an important role in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Acyclic orientationAlgebraic graph theoryAntiferromagnetismBollobás–Riordan polynomial

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
CMC Technologies for Teaching Foreign Languages: What's on the Horizon?
Computer-mediated communication (CMC) technologies have begun to play an increasingly important role in the teaching of foreign… 
Review
2012
Review
2012
MILKY WAY STAR-FORMING COMPLEXES AND THE TURBULENT MOTION OF THE GALAXY'S MOLECULAR GAS
We analyze Spitzer GLIMPSE, Midcourse Space Experiment (MSX), and Wilkinson Microwave Anisotropy Probe (WMAP) images of the Milky… 
2012
2012
The giant component of the random bipartite graph
The random bipartite graph G(m,n; p) is the random graph obtained by taking the complete bipartite graph Km,n and deleting each… 
2009
2009
Edge-Selection Heuristics for Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial… 
2006
2006
Tetromino tilings and the Tutte polynomial
We consider tiling rectangles of size 4m × 4n by T-shaped tetrominoes. Each tile is assigned a weight that depends on its… 
Highly Cited
2002
Highly Cited
2002
HOSOYA POLYNOMIAL IN TORI
Commun. Math. Comput. Chem. (MATCH), 2002, 45, 109-122 Abstract. The Hosoya polynomial is defined as a distance-based increasing… 
2000
2000
Distribution and representative whole-rock chemistry of deep-seated xenoliths from the Iblean Plateau, south-eastern Sicily, Italy
Eighteen unpublished whole-rock chemical analyses on Iblean deep-seated xenoliths, combined with twenty- nine analyses reported… 
Highly Cited
1986
Highly Cited
1986
Randomness, Relativizations, and Polynomial Reducibilities
We show that, for any set A which cannot be computed in polynomial time, the class of sets p-many-one incomparable with A has… 
1983
1983
Integrated Optical Circuits For Numerical Computation
Recent developments in the design of integrated optical circuits for performing optical numerical computations are discussed. The… 
Highly Cited
1970
Highly Cited
1970
On cyclic codes that are invariant under the general linear group
Using a polynomial approach to linear codes, one derives necessary and sufficient conditions for cyclic q -ary codes to be… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)