Maximal Eulerian subgraph in a given graph

526 Views Asked by At

Given a graph like the following:

Given graph

how do I find the maximal Eulerian subgraph? The answer for this case should be (subgraph with blue edges):

Answer

In general, is there an algorithm to derive this particular subgraph?