Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I have a homework in my graph course. It asks something about minimum Eulerian partition but it doesn't give any information about it. I googled it but couldn't come up anything useful and clear. Is there anybody here who can explain me what it is?

Thanks in advance.

share|cite|improve this question

An Eulerian partition of $G$ is a partition of the edges of $G$ into edge-disjoint circuits. (That is, different circuits may share vertices, but they may not have any edges in common.) I imagine that a minimal Eulerian partition is one that has the smallest possible number of circuits, though I’m happy to be corrected by someone better acquainted with the subject.

share|cite|improve this answer
thakns for the input – newbieee Nov 5 '12 at 20:07
@newbieee: You’re welcome. – Brian M. Scott Nov 5 '12 at 20:09

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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