Given a graph like the following:

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

In general, is there an algorithm to derive this particular subgraph?
Given a graph like the following:

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

In general, is there an algorithm to derive this particular subgraph?
Copyright © 2021 JogjaFile Inc.