-1
$\begingroup$

I know that if $G$ is Eulerian, then every block contained within it is also Eulerian, but is the converse true?

$\endgroup$
1
  • $\begingroup$ Is G connected? $\endgroup$
    – saulspatz
    Apr 4, 2018 at 19:16

1 Answer 1

0
$\begingroup$

If every block is Eulerian, then every vertex in $G$ which is the edge-disjoint union of its blocks has even degree. This holds for connected graphs $G$.

$\endgroup$

Not the answer you're looking for? Browse other questions tagged or ask your own question.