Weighted Interlace Polynomials

DOI10.1017/S0963548309990381zbMath1216.05059arXiv0808.1888MaRDI QIDQ3557529

Lorenzo Traldi

Publication date: 23 April 2010

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0808.1888

Mathematics Subject Classification ID

Graph polynomials (05C31) Signed and weighted graphs (05C22)

Related Items (5)

The adjacency matroid of a graph ⋮ Fast evaluation of interlace polynomials on graphs of bounded treewidth ⋮ Binary matroids and local complementation ⋮ A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS ⋮ On the interlace polynomials of forests

Cites Work

• A two-variable interlace polynomial
• Interval partitions and activities for the greedoid Tutte polynomial
• Tutte polynomials computable in polynomial time
• The interlace polynomial of a graph
• A Tutte polynomial for signed graphs
• Circle graphs and monadic second-order logic
• Reducing prime graphs and recognizing circle graphs
• Generalized activities and the Tutte polynomial
• Circle graph obstructions
• Interlace polynomials
• Series and parallel reductions for the Tutte polynomial
• The interlace polynomial of graphs at \(-1\)
• A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
• On Invariants of Graphs with Applications to Knot Theory
• Digraph Decompositions and Eulerian Systems
• Decomposition of Directed Graphs
• Distance Hereditary Graphs and the Interlace Polynomial
• A higher invariant for matroids
• Multimatroids. III: Tightness and fundamental graphs

This page was built for publication: Weighted Interlace Polynomials