Assertion: graph | /r/HasAspect | pathwidth
Facets:
Source sentences:
text: If a graph has treewidth or pathwidth at most k, then it is a subgraph of a chordal graph which has a perfect elimination ordering in which each vertex has at most k earlier neighbors.