Assertion: graph's degree | /r/HasProperty | bounded by constant
Facets:
Source sentences:
text: There is a polynomial time algorithm for solving the graph automorphism problem for graphs where vertex degrees are bounded by a constant.