On the evaluation at (3,3) of the Tutte polynomial of a graph

DOI10.1016/0095-8956(88)90079-2zbMATH Open0674.05024OpenAlexW2015927509WikidataQ29544772 ScholiaQ29544772MaRDI QIDQ1121273FDOQ1121273

Authors: Michel Las Vergnas 

Publication date: 1988

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(88)90079-2

Recommendations

• On Tutte polynomials and cycles of plane graphs
• Exploring the Tutte-Martin connection
• Parity, Eulerian subgraphs and the Tutte polynomial
• Evaluations of topological Tutte polynomials
• Identities for circuit partition polynomials, with applications to the Tutte polynomial

zbMATH Keywords

dichromatic polynomialplanar graphdivisibility propertyTutte Polynomial

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• On the Tutte Polynomial of a Morphism of Matroids
• Title not available (Why is that?)
• Title not available (Why is that?)
• Le Polynôme De Martin D'un Graphe Eulerien
• On the Principal Edge Tripartition of a Graph
• Remarkable valuation of the dichromatic polynomial of planar multigraphs
• Title not available (Why is that?)

Cited In (29)

• Tutte relations, TQFT, and planarity of cubic graphs
• Distance Hereditary Graphs and the Interlace Polynomial
• A dichotomy for real weighted Holant problems
• Beyond \#CSP: a dichotomy for counting weighted Eulerian orientations with ARS
• The interlace polynomial of a graph
• Isotropic systems
• Tutte-Martin polynomials and orienting vectors of isotropic systems
• Interlace polynomials
• On Tutte polynomials of matroids representable over \(GF(q)\)
• Counterexamples to a conjecture of Las Vergnas
• On the evaluation at \((j,j^2)\) of the Tutte polynomial of a ternary matroid
• A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs
• Fast evaluation of interlace polynomials on graphs of bounded treewidth
• Title not available (Why is that?)
• Properties of the corolla polynomial of a 3-regular graph
• Beyond windability: approximability of the four-vertex model
• Complexity classification of the eight-vertex model
• Graphic presentations of isotropic systems
• Identities for circuit partition polynomials, with applications to the Tutte polynomial
• New results for the Martin polynomial
• Exploring the Tutte-Martin connection
• A recipe theorem for the topological Tutte polynomial of Bollobás and Riordan
• Some new evaluations of the Tutte polynomial
• Planarity, symmetry and counting tilings
• Complexity classification of the six-vertex model
• The Tutte polynomial of a morphism of matroids. III: Vectorial matroids
• Evaluations of the circuit partition polynomial
• Orienting transversals and transition polynomials of multimatroids
• A graph integral formulation of the circuit partition polynomial

This page was built for publication: On the evaluation at (3,3) of the Tutte polynomial of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1121273)