The interlace polynomial of graphs at -1
From MaRDI portal
Publication:1864589
DOI10.1006/EUJC.2002.0602zbMATH Open1017.05076OpenAlexW2031388593MaRDI QIDQ1864589FDOQ1864589
Authors: Béla Bollobás, Luke Pebody, Paul Balister, Jonathan Cutler
Publication date: 18 March 2003
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.2002.0602
Recommendations
Cites Work
Cited In (19)
- The adjacency matroid of a graph
- Interlace polynomials for multimatroids and delta-matroids
- Interlace polynomials of lollipop and tadpole graphs
- Distance Hereditary Graphs and the Interlace Polynomial
- A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
- On the linear algebra of local complementation
- The interlace polynomial of a graph
- The cyclomatic number of a graph and its independence polynomial at \(- 1\)
- Interlace polynomials
- Interlace polynomials of 4n-snowflake graphs
- Weighted interlace polynomials
- Interlace polynomials of ladder graphs
- Interlace polynomials of friendship graphs
- Binary matroids and local complementation
- Interlace polynomials: enumeration, unimodality and connections to codes
- Interlace polynomials of \(n\)-claw graphs
- The domination polynomial of a graph at \(-1\)
- A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS
- Orienting transversals and transition polynomials of multimatroids
This page was built for publication: The interlace polynomial of graphs at \(-1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1864589)