Pages that link to "Item:Q2929592"
From MaRDI portal
The following pages link to Connection matrices and the definability of graph parameters (Q2929592):
Displaying 8 items.
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- The connectivity of the interchange graph of class \({\mathfrak A}(R,S)\) of (0,1)-matrices (Q1097284) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- Recognizable series on graphs and hypergraphs (Q2424675) (← links)
- Logics of Finite Hankel Rank (Q2947177) (← links)
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- Counting problems in parameterized complexity (Q5009461) (← links)
- Harary polynomials (Q5056203) (← links)