On graphs determined by their Tutte polynomials
From MaRDI portal
Publication:1889848
DOI10.1007/s00373-003-0534-zzbMath1053.05057OpenAlexW1976183323WikidataQ29040360 ScholiaQ29040360MaRDI QIDQ1889848
Publication date: 13 December 2004
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-003-0534-z
Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)
Related Items (19)
Graphs determined by polynomial invariants ⋮ On sequences of polynomials arising from graph invariants ⋮ Note on the subgraph component polynomial ⋮ The Tutte polynomial of some matroids ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ Distinguishing graphs by their left and right homomorphism profiles ⋮ Unnamed Item ⋮ T-uniqueness of some families of \(k\)-chordal matroids ⋮ On the differential polynomial of a graph ⋮ On chromatic and flow polynomial unique graphs ⋮ Non-isomorphic caterpillars with identical subtree data ⋮ The behavior of Tutte polynomials of graphs under five graph operations and its applications ⋮ Combinatorial anti-concentration inequalities, with applications ⋮ On Tutte polynomial uniqueness of twisted wheels ⋮ Locally grid graphs: Classification and Tutte uniqueness ⋮ Homomorphisms and polynomial invariants of graphs ⋮ Tutte uniqueness of line graphs ⋮ Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness” ⋮ On matroids determined by their Tutte polynomials
This page was built for publication: On graphs determined by their Tutte polynomials
