Binary nullity, Euler circuits and interlace polynomials

DOI10.1016/j.ejc.2011.02.004zbMath1227.05168arXiv0903.4405OpenAlexW2151838441MaRDI QIDQ2275481

Lorenzo Traldi

Publication date: 9 August 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Graph polynomials (05C31) Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20)

Related Items (12)

Graph-links: nonrealizability, orientation, and Jones polynomial ⋮ A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS ⋮ A parity map of framed chord diagrams ⋮ Sorting by reversals and the theory of 4-regular graphs ⋮ The adjacency matroid of a graph ⋮ Nullity-based matroid of rough sets and its application to attribute reduction ⋮ Nullity invariance for pivot and the interlace polynomial ⋮ Fast evaluation of interlace polynomials on graphs of bounded treewidth ⋮ Parity in knot theory and graph-links ⋮ On the linear algebra of local complementation ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Matroids, delta-matroids and embedded graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two-variable interlace polynomial
• The interlace polynomial of a graph
• Chords in a circle and linear algebra over GF(2)
• A multivariate interlace polynomial and its computation for graphs of bounded clique-width
• Cycle decomposition by disjoint transpositions
• Cycle decomposition by transpositions
• On a formula for the number of Euler trails for a class of digraphs
• Interlace polynomials
• A few weight systems arising from intersection graphs
• Virtual knot theory
• On the product of certain permutations
• A matrix for computing the Jones polynomial of a knot
• An alternative formula for the number of Euler trails for a class of digraphs
• \(J\)-invariants of plane curves and framed chord diagrams
• INTRODUCTION TO GRAPH-LINK THEORY
• A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS
• On the number of Euler trails in directed graphs
• VASSILIEV KNOT INVARIANTS COMING FROM LIE ALGEBRAS AND 4-INVARIANTS
• A BRACKET POLYNOMIAL FOR GRAPHS, I

This page was built for publication: Binary nullity, Euler circuits and interlace polynomials