The following pages link to (Q4952623):
Displaying 26 items.
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- The adjacency matroid of a graph (Q396844) (← links)
- Interlace polynomials for multimatroids and delta-matroids (Q402472) (← links)
- Binary matroids and local complementation (Q482118) (← links)
- The transition matroid of a 4-regular graph: an introduction (Q491757) (← links)
- The group structure of pivot and loop complementation on graphs and set systems (Q648991) (← links)
- On the linear algebra of local complementation (Q665929) (← links)
- The interlace polynomial of a graph (Q705880) (← links)
- Graph polynomials from principal pivoting (Q856875) (← links)
- On the interlace polynomials of forests (Q1045139) (← links)
- Farrell polynomials on graphs of bounded tree width (Q1398293) (← links)
- Interlace polynomials (Q1418963) (← links)
- Identities for circuit partition polynomials, with applications to the Tutte polynomial (Q1433000) (← links)
- Euler circuits and DNA sequencing by hybridization (Q1585320) (← links)
- Alternating knot diagrams, Euler circuits and the interlace polynomial (Q1840823) (← links)
- Evaluations of the circuit partition polynomial (Q1850612) (← links)
- The interlace polynomial of graphs at \(-1\) (Q1864589) (← links)
- Binary nullity, Euler circuits and interlace polynomials (Q2275481) (← links)
- Nullity invariance for pivot and the interlace polynomial (Q2431190) (← links)
- Graph polynomials derived from Tutte-Martin polynomials (Q2575784) (← links)
- The universal valuation of Coxeter matroids (Q5006391) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- Bipartite graphs as polynomials and polynomials as bipartite graphs (Q5162789) (← links)
- The interlace polynomial and the Tutte–Martin polynomial (Q5890008) (← 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)
