The following pages link to (Q3118380):
Displaying 7 items.
- On the complexity of the identifiable subgraph problem (Q2255039) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- The number of labeled connected graphs modulo prime powers (Q2808161) (← links)
- Semantic Equivalence of Graph Polynomials Definable in Second Order Logic (Q2820700) (← links)
- Logics of Finite Hankel Rank (Q2947177) (← links)
- On the Tutte and Matching Polynomials for Complete Graphs (Q5038571) (← links)
- Extensions and limits of the Specker-Blatter theorem (Q6642890) (← links)