Pages that link to "Item:Q2922717"
From MaRDI portal
The following pages link to The use of the chromatic polynomial of a graph in enumerative combinatorics (Q2922717):
Displaying 6 items.
- Enumerating some stable partitions involving Stirling and \(r\)-Stirling numbers of the second kind (Q723786) (← links)
- Generalized chromatic polynomials (Q795839) (← links)
- Remarks on umbral evaluations of chromatic polynomials (Q1318843) (← links)
- Chromatic polynomials of partition systems (Q1356481) (← links)
- Enumerative properties of Ferrers graphs (Q1764162) (← links)
- Chromatic polynomials and \(k\)-trees (Q2777544) (← links)