Binary nullity, Euler circuits and interlace polynomials
From MaRDI portal
Publication:2275481
DOI10.1016/j.ejc.2011.02.004zbMath1227.05168arXiv0903.4405MaRDI QIDQ2275481
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
05C31: Graph polynomials
05A15: Exact enumeration problems, generating functions
05C20: Directed graphs (digraphs), tournaments