The following pages link to On Counting Generalized Colorings (Q3540189):
Displaying 11 items.
- On weak chromatic polynomials of mixed graphs (Q489344) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Polynomial graph invariants from homomorphism numbers (Q906477) (← links)
- Twin-width and generalized coloring numbers (Q2065919) (← links)
- A logician's view of graph polynomials (Q2273013) (← links)
- On sequences of polynomials arising from graph invariants (Q2408975) (← links)
- (Q3456843) (← links)
- Connection Matrices for MSOL-Definable Structural Invariants (Q3601800) (← links)
- (Q4731201) (← links)
- Harary polynomials (Q5056203) (← links)
- How I got to like graph polynomials (Q6593617) (← links)