Assertion: graph's g | /r/MadeOf | a u-v walk of length ℓ
Facets:
Source sentences:
text: If a graph G contains a u-v walk of length ℓ {\displaystyle \ell } , then G contains a u-v path of length ≤ ℓ {\displaystyle \ell } .