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

Is it possible to distinguish planar and non-planar graphs (networks as a matter of fact) by flows? That is, is there a flow criterion for a graph being planar or not?

share|cite|improve this question
I doubt that. A graph is planar iff it doesn not contain a subdivision of $K_5$ or $K_{3,3}$. I don't see how flow enters there easily. – Hagen von Eitzen Jan 25 '13 at 10:03

Your Answer


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

Browse other questions tagged or ask your own question.