Pages that link to "Item:Q2408975"
From MaRDI portal
The following pages link to On sequences of polynomials arising from graph invariants (Q2408975):
Displaying 11 items.
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Recurrence relations for graph polynomials on bi-iterative families of graphs (Q740263) (← links)
- Graph recurrence (Q1869026) (← links)
- Polynomials counting nowhere-zero chains in graphs (Q2073314) (← links)
- Genus polynomials of ladder-like sequences of graphs (Q2196486) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- On connection sequence for equivalent polynomial sets (Q2812113) (← links)
- Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (Q2820700) (← links)
- A sequence of complexes generated by a finite set of homogeneous polynomials (Q4209352) (← links)
- Discriminants, Symmetrized Graph Monomials, and Sums Of Squares (Q4908499) (← links)
- On three polynomial kernels of sequences for arbitrarily partitionable graphs (Q5962512) (← links)