Tutte-Martin polynomials and orienting vectors of isotropic systems

DOI10.1007/BF01787630zbMath0760.05019OpenAlexW1987955590MaRDI QIDQ1180433

André Bouchet

Publication date: 27 June 1992

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01787630

zbMATH Keywords

isotropic systemsorienting vectorsTutte-Martin polynomials

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Eulerian and Hamiltonian graphs (05C45)

Related Items

Isotropic systems, Connectivity and \(\beta\)-invariants of isotropic systems and 4-regular graphs, Graph polynomials from principal pivoting, Graphic presentations of isotropic systems, On Tutte polynomials of matroids representable over \(GF(q)\), Interlace polynomials for multimatroids and delta-matroids, Counterexamples to a conjecture of Las Vergnas, Fast evaluation of interlace polynomials on graphs of bounded treewidth, Interlace polynomials, Identities for circuit partition polynomials, with applications to the Tutte polynomial, The Tutte polynomial of a morphism of matroids. III: Vectorial matroids, Binary matroids and local complementation, Orienting transversals and transition polynomials of multimatroids, Recognizing locally equivalent graphs, Distance Hereditary Graphs and the Interlace Polynomial, The interlace polynomial of a graph, A Graph Integral Formulation of the Circuit Partition Polynomial, Exploring the Tutte-Martin connection, Graph polynomials derived from Tutte-Martin polynomials, Evaluations of the circuit partition polynomial

Cites Work

• Unnamed Item
• Isotropic systems
• Graphic presentations of isotropic systems
• On the evaluation at (3,3) of the Tutte polynomial of a graph
• Le Polynôme De Martin D'un Graphe Eulerien
• Greedy algorithm and symmetric matroids
• On the Principal Edge Tripartition of a Graph