Assertion: graph's automorphism | /r/HasProperty | constrained in certain fashion
Facets:
Source sentences:
text: By contrast, hardness is known when the automorphisms are constrained in a certain fashion; for instance, determining the existence of a fixed-point-free automorphism (an automorphism that fixes no vertex) is NP-complete, and the problem of counting such automorphisms is #P-complete.