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?
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
2 years ago