Assertion: graph's number | /r/HasProperty | minimal vertex separators
Facets:
Source sentences:
text: the treewidth and pathwidth of permutation graphs can be computed in polynomial time; these algorithms exploit the fact that the number of inclusion minimal vertex separators in a permutation graph is polynomial in the size of the graph.