Assertion: graph | /r/CapableOf | bound treewidth
Facets:
Source sentences:
text: Graphs with bounded cyclomatic number, vertex cover number or max leaf number all have bounded treewidth, however it is an open problem to determine the complexity of the metric dimension problem even on graphs of treewidth 2, that is, series-parallel graphs (Belmonte et al. 2015).