tag:blogger.com,1999:blog-4115025577315673827.post3605489652044623173..comments2019-10-23T18:01:26.365+05:30Comments on CSE Blog - quant, math, computer science puzzles: City PlanningUnknownnoreply@blogger.comBlogger2125tag:blogger.com,1999:blog-4115025577315673827.post-12147077306271636082010-06-17T20:30:02.624+05:302010-06-17T20:30:02.624+05:30If we look at it from the point of view of Graph t...If we look at it from the point of view of Graph theory, it seems impossible, since K(3,3) is non-planar..<br />But in this problem, you're allowed to modify the graph, so that there exists a "path" (not necessarily an edge) from every vertex on one side to every vertex on the other side. :)Pritishhttps://www.blogger.com/profile/04147166709938295125noreply@blogger.comtag:blogger.com,1999:blog-4115025577315673827.post-31995999363182716742010-06-03T23:38:29.193+05:302010-06-03T23:38:29.193+05:30Seems like the pipes and wires do not all need to ...Seems like the pipes and wires do not all need to be in the same plane, in which case the problem is easy :)mathmomhttps://www.blogger.com/profile/05869925405540832241noreply@blogger.com