The following pages link to The interlace polynomial of a graph (Q705880):
Displaying 48 items.
- The adjacency matroid of a graph (Q396844) (← links)
- Interlace polynomials for multimatroids and delta-matroids (Q402472) (← links)
- Graph reductions, binary rank, and pivots in gene assembly (Q411856) (← links)
- Eulerian digraphs and toric Calabi-Yau varieties (Q467294) (← links)
- Binary matroids and local complementation (Q482118) (← links)
- The transition matroid of a 4-regular graph: an introduction (Q491757) (← links)
- Fast evaluation of interlace polynomials on graphs of bounded treewidth (Q634679) (← links)
- The enumeration of vertex induced subgraphs with respect to the number of components (Q648958) (← links)
- The group structure of pivot and loop complementation on graphs and set systems (Q648991) (← links)
- Random tensor theory: Extending random matrix theory to mixtures of random product states (Q664332) (← links)
- On the linear algebra of local complementation (Q665929) (← links)
- Orienting transversals and transition polynomials of multimatroids (Q679544) (← links)
- Pivots, determinants, and perfect matchings of graphs (Q714808) (← links)
- Circle graphs and monadic second-order logic (Q946577) (← links)
- Interlace polynomials: enumeration, unimodality and connections to codes (Q968188) (← links)
- Edge local complementation and equivalence of binary linear codes (Q1009082) (← links)
- From a zoo to a zoology: Towards a general theory of graph polynomials (Q1015377) (← links)
- Circle graphs and the cycle double cover conjecture (Q1025572) (← links)
- On the interlace polynomials of forests (Q1045139) (← links)
- Entanglement criteria for the bosonic and fermionic induced ensembles (Q2102807) (← links)
- On graphs and codes preserved by edge local complementation (Q2260792) (← links)
- Binary nullity, Euler circuits and interlace polynomials (Q2275481) (← links)
- Nullity invariance for pivot and the interlace polynomial (Q2431190) (← links)
- The nullity theorem for principal pivot transform (Q2435565) (← links)
- Rank-width and vertex-minors (Q2565688) (← links)
- On the reconstruction of graph invariants (Q2851492) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, III: VERTEX WEIGHTS (Q3000673) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, IV: UNDIRECTED EULER CIRCUITS, GRAPH-LINKS AND MULTIPLY MARKED GRAPHS (Q3173279) (← links)
- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants (Q3507454) (← links)
- Weighted Interlace Polynomials (Q3557529) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, II: LINKS, EULER CIRCUITS AND MARKED GRAPHS (Q3560276) (← links)
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- The universal valuation of Coxeter matroids (Q5006391) (← links)
- Interlace polynomials of friendship graphs (Q5009988) (← links)
- On the Tutte and Matching Polynomials for Complete Graphs (Q5038571) (← links)
- Interlace polynomials of lollipop and tadpole graphs (Q5081222) (← links)
- Bipartite graphs as polynomials and polynomials as bipartite graphs (Q5162789) (← links)
- Evaluations of Graph Polynomials (Q5302054) (← links)
- Exclusivity structures and graph representatives of local complementation orbits (Q5407615) (← links)
- Distance Hereditary Graphs and the Interlace Polynomial (Q5428369) (← links)
- Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)
- A BRACKET POLYNOMIAL FOR GRAPHS, I (Q5851749) (← links)
- The expansion of a chord diagram and the Tutte polynomial (Q5916013) (← links)
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals (Q6064591) (← links)
- Random feedback shift registers and the limit distribution for largest cycle lengths (Q6085869) (← links)
- Interlace polynomials of 4n-snowflake graphs (Q6164661) (← links)
- Signed permutohedra, delta‐matroids, and beyond (Q6204196) (← links)
- Vertex-minors of graphs: a survey (Q6495258) (← links)
