Interlace polynomials

DOI10.1016/j.laa.2003.06.010zbMath1030.05071OpenAlexW4206433460MaRDI QIDQ1418963

Hein van der Holst, Martin Aigner

Publication date: 14 January 2004

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2003.06.010

zbMATH Keywords

Tutte polynomialBinary matroidInterface polynomialIsotropic system

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items

A tight relation between series-parallel graphs and bipartite distance hereditary graphs ⋮ Graph polynomials from principal pivoting ⋮ The adjacency matroid of a graph ⋮ Interlace polynomials for multimatroids and delta-matroids ⋮ Interlace polynomials of 4n-snowflake graphs ⋮ Signed permutohedra, delta‐matroids, and beyond ⋮ Fast evaluation of interlace polynomials on graphs of bounded treewidth ⋮ The nullity theorem for principal pivot transform ⋮ The enumeration of vertex induced subgraphs with respect to the number of components ⋮ The group structure of pivot and loop complementation on graphs and set systems ⋮ Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width ⋮ Binary matroids and local complementation ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Weighted Interlace Polynomials ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ Interlace polynomials: enumeration, unimodality and connections to codes ⋮ On graphs and codes preserved by edge local complementation ⋮ Distance Hereditary Graphs and the Interlace Polynomial ⋮ The interlace polynomial of a graph ⋮ Binary nullity, Euler circuits and interlace polynomials ⋮ Quantum stabilizer codes, lattices, and CFTs ⋮ Edge local complementation and equivalence of binary linear codes ⋮ From a zoo to a zoology: Towards a general theory of graph polynomials ⋮ Circle graphs and the cycle double cover conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Isotropic systems
• Graphic presentations of isotropic systems
• On the evaluation at (3,3) of the Tutte polynomial of a graph
• On Tutte polynomials of matroids representable over \(GF(q)\)
• Tutte-Martin polynomials and orienting vectors of isotropic systems
• Le Polynôme De Martin D'un Graphe Eulerien
• On the Principal Edge Tripartition of a Graph

This page was built for publication: Interlace polynomials