MathOverflow is a question and answer site for professional mathematicians. 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 understand that there is a polynomial algorithm to solve TSPs that are in solid grid graph form (grid graphs without holes).

I am particularly interested in the non-solid grid graph form of the HCP / TSP problems. In other words, I would like to find some instances of the grid graphs that are non-solid.

Googling is to no avail. Does anyone know of a good resource?

share|cite|improve this question
It's not clear to me what you want? Examples of graphs? – Chris Godsil Apr 29 '12 at 13:04
Yes. Grid graphs with wholes.. I reckon I can do my own but I would like to find sources with known solutions. – darryl Apr 30 '12 at 10:44

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.