The interlace polynomial of graphs at -1
From MaRDI portal
Recommendations
Cites work
Cited in
(19)- The adjacency matroid of a graph
- Interlace polynomials for multimatroids and delta-matroids
- A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
- Interlace polynomials of lollipop and tadpole graphs
- Distance Hereditary Graphs and the Interlace Polynomial
- 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 friendship graphs
- Interlace polynomials of ladder graphs
- Binary matroids and local complementation
- Interlace polynomials: enumeration, unimodality and connections to codes
- The domination polynomial of a graph at -1
- Interlace polynomials of \(n\)-claw graphs
- 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)