Compact connected regular graphs

[Mark Lawrence]

On 06/03/2016 11:04, jonas.thornvall at gmail.com wrote:
> Den söndag 6 mars 2016 kl. 12:01:02 UTC+1 skrev Mark Lawrence:
>> On 06/03/2016 10:39, jonas.thornvall at gmail.com wrote:
>>> How come all graphs using 42 links and more then 84 nodes have compact  regular connected solutions?
>>>
>>> Did turn off animation for more than a couple of thousands of  links so the animation is off when searching but script give message and numerical results on search.
>>>
>>> http://jt.node365.se/nodes15.html
>>>
>>> Do anyone know?
>>>
>>>
>>> http://jt.node365.se/Compact.rtf
>>>
>>
>> Where is the Python question here?
>>
>> --
>> My fellow Pythonistas, ask not what our language can do for you, ask
>> what you can do for our language.
>>
>> Mark Lawrence
>
> It is the Python that squeeze the information out of the graphs.
>

I'll try again, where is the Python question here?

-- 
My fellow Pythonistas, ask not what our language can do for you, ask
what you can do for our language.

Mark Lawrence