== include(page="template/taskheader" task_id="ndgp") ==

== include(page="template/taskheader" task_id="ndap") ==

Fie $G = (V, E)$ un graf neorientat cu $V$ multimea varfurilor, iar $E$ multimea muchiilor. Definim un **graf partial** a lui $G$ graful $P = (V, E')$ cu $E'$ inclus in $E$.