Assertion: graph's path | /r/HasProperty | ear
Facets:
Source sentences:
text: An open ear is a simple path (an ear without repeated vertices), and an open ear decomposition is an ear decomposition in which each ear after the first is open; a graph has an open ear decomposition if and only if it is biconnected.