Am I on the right track?k (for 7) = 21. k (for 13) = 52.

<t>QuoteOriginally posted by: sevvostI am sorry, I don't see any problem with the Eulerian path proof given by zarnywhoop. I think it works just fine (and is in fact very elegant.)I guess then that I don't see how the local route imposes the condition that the external container of the graph must al...

<t>QuoteOriginally posted by: zarnywhoopI like this proof better (I didn't come up with it):For each subrectangle, pick a pair of parallel edges which are integral in length, and draw red lines along these edges. The graph whose edges are the red lines has vertices of degree 1 at each of the corners...