Polynomial invariants of graphs

No abstract is available for this paper.

• Publication year

  1987

• Venue

  Transactions of the American Mathematical Society

• Publication date

  1987-02-01

• Fields of study

  Mathematics

• Identifiers
  DOI 10.1090/S0002-9947-1987-0869224-1
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• 2-Isomorphic Graphs

  1933cited by this paper
• Non-Separable and Planar Graphs.

  1931cited by this paper

• A Negami-type splitting formula for the Jones and Ribbon graph polynomials

  2025influential citation
• Constructing a Tutte polynomial for graphs embedded in surfaces

  2025cites this paper
• Tutte polynomials for some chemical polycyclic graphs

  2023influential citation
• Mitochondrial networks through the lens of mathematics

  2023cites this paper
• Yamada polynomial and associated link of θ-curves

  2022cites this paper
• Quantum network reliability with perfect nodes

  2022cites this paper
• The Tutte polynomials of catacondensed benzenoid systems

  2021cites this paper
• Systematic Enumeration and Identification of Unique Spatial Topologies of 3D Systems Using Spatial Graph Representations

  2021cites this paper
• Tutte polynomials of fan-like graphs with applications in benzenoid systems

  2021cites this paper
• Enumeration and Identification of Unique 3D Spatial Topologies of Interconnected Engineering Systems Using Spatial Graphs

  2021cites this paper
• Tutte Polynomial, Complete Invariant, and Theta Series

  2020cites this paper
• Negami's like splitting formula for the Jones polynomial

  2019cites this paper
• The generalized Yamada polynomials of virtual spatial graphs

  2018cites this paper
• Density of Roots of the Yamada Polynomial of Spatial Graphs

  2018cites this paper
• The Yamada polynomial of spatial graphs obtained by edge replacements

  2018influential citation
• A note on Möbius algebras and applications

  2018cites this paper
• Edge cut splitting formulas for Tutte-Grothendieck invariants

  2017cites this paper
• Tutte polynomial general factorization

  2016influential citation
• Singularities in Negami's splitting formula for the Tutte polynomial

  2016influential citation
• Tutte polynomial general factorization for graphs on general specializations

  2016influential citation
• Tutte polynomials for benzenoid systems with one branched hexagon

  2016cites this paper
• ON A RECURSIVE POLYNOMIAL GRAPH INVARIANT FOR CHAINS OF POLYGONS

  2014cites this paper
• On Deletion-Contraction Polynomials for Polycyclic Chains ∗

  2014cites this paper
• Potts model partition functions on two families of fractal lattices

  2014cites this paper
• Graph polynomials and their representations

  2012cites this paper
• The Tutte polynomial and the automorphism group of a graph

  2011influential citation
• Splitting the K-Terminal Reliability

  2011cites this paper
• Computational complexity of graph polynomials

  2010cites this paper
• Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth

  2009cites this paper
• Counting truth assignments of formulas of bounded tree-width or clique-width

  2008cites this paper
• Counting truth assignments of formulas of bounded treewidth or clique-width 3

  2007cites this paper
• Yamada Polynomial and Khovanov Cohomology

  2006cites this paper
• On the colored Tutte polynomial of a graph of bounded treewidth

  2006influential citation
• On the Yoshinaga polynomial of spatial graphs

  2003cites this paper
• Bounded Treewidth Graphs – A Survey German Russian Winter

  2003cites this paper
• From Edge Decomposition Formulae to Composition Algorithms

  2002cites this paper
• Minimal Spanning Trees for Graphs with Random Edge Lengths

  2002cites this paper
• Topological Graph Theory from Japan

  2001influential citation
• Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width

  2001cites this paper
• Contraction-Deletion Invariants for Graphs

  2000cites this paper
• A Tutte Polynomial for Coloured Graphs

  1999cites this paper
• Computing invariants in graphs of small bandwidth

  1999cites this paper
• An algorithm for the Tutte polynomials of graphs of bounded treewidth

  1998influential citation
• The Tutte dichromate and Whitney homology of matroids

  1997cites this paper
• Splitting Formulas for Tutte Polynomials

  1997cites this paper
• A bibliography on chromatic polynomials

  1997cites this paper
• Polynomial invariants of graphs II

  1996cites this paper
• A polynomial time algorithm for computation of the Tutte polynomials of graphs of bounded treewidth

  1995cites this paper
• Polynomial Invariants of Graphs with State Models

  1995cites this paper
• POLYNOMIAL INVARIANTS OF EMBEDDINGS OF GRAPHS ON CLOSED SURFACES

  1995cites this paper
• Subexponentially computable truncations of Jones-types polynomials

  1991cites this paper
• Algebraic Topological Indices of Molecular Chirality

  1991cites this paper
• Splitting formulas for computing connectedness probability of undirected graphs

  1990cites this paper
• A note on Negami's polynomial invariants for graphs

  1989cites this paper
• On invariants of graphs with applications to knot theory

  1989cites this paper
• An invariant of spatial graphs

  1989cites this paper
• A pr 2 01 1 Splitting the K-Terminal Reliability

  year unknowncites this paper