European Journal of Combinatorics
New invariants in the theory of knots
American Mathematical Monthly
On Tutte polynomials and cycles of plane graphs
Journal of Combinatorial Theory Series A
Graphic presentations of isotropic systems
Journal of Combinatorial Theory Series A
On the evaluation at (3,3) of the Tutte polynomial of a graph
Journal of Combinatorial Theory Series B
Recognizing circle graphs in polynomial time
Journal of the ACM (JACM)
Generating functionology
Approximate string-matching with q-grams and maximal matches
Theoretical Computer Science - Selected papers of the Combinatorial Pattern Matching School
The coefficients of the Tutte polynomial are not unimodal
Journal of Combinatorial Theory Series B
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
Journal of Algorithms
New results for the Martin polynomial
Journal of Combinatorial Theory Series B
The interlace polynomial: a new graph polynomial
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Euler circuits and DNA sequencing by hybridization
Discrete Applied Mathematics - Special volume on combinatorial molecular biology
Alternating knot diagrams, Euler circuits and the interlace polynomial
European Journal of Combinatorics
The interlace polynomial of graphs at-1
European Journal of Combinatorics
Evaluations of the circuit partition polynomial
Journal of Combinatorial Theory Series B
A Two-Variable Interlace Polynomial
Combinatorica
Journal of Combinatorial Theory Series B
Edge local complementation and equivalence of binary linear codes
Designs, Codes and Cryptography
Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Evaluations of Graph Polynomials
Graph-Theoretic Concepts in Computer Science
Connection Matrices for MSOL-Definable Structural Invariants
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Weighted interlace polynomials
Combinatorics, Probability and Computing
Interlace polynomials: Enumeration, unimodality and connections to codes
Discrete Applied Mathematics
Linear recurrence relations for graph polynomials
Pillars of computer science
Binary nullity, Euler circuits and interlace polynomials
European Journal of Combinatorics
The enumeration of vertex induced subgraphs with respect to the number of components
European Journal of Combinatorics
Computing graph polynomials on graphs of bounded clique-width
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
One and two-variable interlace polynomials: a spectral interpretation
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
From a zoo to a zoology: descriptive complexity for graph polynomials
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Pivot and loop complementation on graphs and set systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
Univariate and multivariate merit factors
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Pivots, determinants, and perfect matchings of graphs
Theoretical Computer Science
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable "interlace polynomial" for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and fuse reduction characterizing the Tutte polynomial.It emerges that the interlace graph polynomial may be viewed as a special case of the Martin polynomial of an isotropic system, which underlies its connections with the circuit partition polynomial and the Kauffman brackets of a link diagram. The graph polynomial, in addition to being perhaps more broadly accessible than the Martin polynomial for isotropic systems, also has a two-variable generalization that is unknown for the Martin polynomial. We consider extremal properties of the interlace polynomial, its values for various special graphs, and evaluations which relate to basic graph properties such as the component and independence numbers.