Assertion: dodecahedron's vertex | /r/HasAspect | degree
Facets:
Source sentences:
text: A simple graph with n vertices ( n ≥ 3 ) is Hamiltonian if every vertex has degree n / 2 or greater.
text: A strongly connected simple directed graph with n vertices is Hamiltonian if every vertex has a full degree greater than or equal to n.