The following pages link to (Q4551368):
Displaying 7 items.
- Towards a dichotomy theorem for the counting constraint satisfaction problem (Q879594) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- On the number of heterochromatic trees in nice and beautiful colorings of complete graphs (Q2062897) (← links)
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees (Q3204040) (← links)
- Locally bounded<i>k</i>-colorings of trees (Q3621974) (← links)
- Colourings of (k-r,k)-trees (Q4690980) (← links)
- ℱ-WORM colorings of some 2-trees: partition vectors (Q5225032) (← links)
