P

Initializing...

A graph with at most three vertices of degree at least two is a triangular forest. · Prove2Me