On the product of certain permutations
European Journal of Combinatorics
An alternative formula for the number of Euler trails for a class of digraphs
Discrete Mathematics
On a formula for the number of Euler trails for a class of digraphs
Discrete Mathematics
European Journal of Combinatorics - In memoriam François Jaeger
The interlace polynomial: a new graph polynomial
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A Two-Variable Interlace Polynomial
Combinatorica
The interlace polynomial of a graph
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Journal of Combinatorial Theory Series B
Nullity-based matroid of rough sets and its application to attribute reduction
Information Sciences: an International Journal
| Hi-index | 0.00 |
A theorem of Cohn and Lempel [M. Cohn, A. Lempel, Cycle decomposition by disjoint transpositions, J. Combin. Theory Ser. A 13 (1972) 83-89] gives an equality relating the number of circuits in a directed circuit partition of a 2-in, 2-out digraph to the GF(2)-nullity of an associated matrix. This equality is essentially equivalent to the relationship between directed circuit partitions of 2-in, 2-out digraphs and vertex-nullity interlace polynomials of interlace graphs. We present an extension of the Cohn-Lempel equality that describes arbitrary circuit partitions in (undirected) 4-regular graphs. The extended equality incorporates topological results that have been of use in knot theory, and it implies that if H is obtained from an interlace graph by attaching loops at some vertices then the vertex-nullity interlace polynomial q"N(H) is essentially the generating function for certain circuit partitions of an associated 4-regular graph.