Ononot — A connected graph G has 20 edges. If G has an Eulerian path

Guest Session: 1 Question Remaining. Create Account to save progress.

Graph Theorymedium

0:00.0

A connected graph $G$ has $20$ edges. If $G$ has an Eulerian path but NOT an Eulerian circuit, how many vertices of odd degree must $G$ have?