Assertion: graph's number | /r/HasProperty | counted by tutte polynomial value
Facets:
value: up to an easily computed factor
type: OTHER
Source sentences:
text: The number of k-colorings is counted (up to an easily computed factor) by the Tutte polynomial value T G (1 − k,0) and dually the number of nowhere-zero k-flows is counted by T G (