Pages that link to "Item:Q1899442"
From MaRDI portal
The following pages link to Chromatic invariants for finite graphs: Theme and polynomial variations (Q1899442):
Displaying 18 items.
- Matroid invariants and counting graph homomorphisms (Q252626) (← links)
- Strongly polynomial sequences as interpretations (Q334158) (← links)
- The odd-even invariant for graphs (Q491743) (← links)
- Link invariants, the chromatic polynomial and the Potts model (Q622296) (← links)
- On the location of roots of graph polynomials (Q740260) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Chromatic polynomial, \(q\)-binomial counting and colored Jones function (Q877731) (← links)
- Polynomial graph invariants from homomorphism numbers (Q906477) (← links)
- On spin models, triply regular association schemes, and duality (Q1804246) (← links)
- Arrangements, channel assignments, and associated polynomials (Q1961908) (← links)
- Burnside chromatic polynomials of group-invariant graphs (Q2107741) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- On sequences of polynomials arising from graph invariants (Q2408975) (← links)
- On the number of \(B\)-flows of a graph (Q2509755) (← links)
- Contractors for flows (Q2838942) (← links)
- Algebraic invariants arising from the chromatic polynomials of theta graphs (Q2876047) (← links)
- A note on Dehn colorings and invariant factors (Q4645691) (← links)
- Monomial invariants applied to graph coloring (Q6116562) (← links)
