Re: Tali's Moogies

In article <9v1qm6$1ok$00$1...@news.t-online.com>, Johannes 'Joey' R�ssel wrote:

>Is istn't possible. For you have more than 2 'nodes' 
>with an uneven number
>of lines goint to (or from?) it. Never had Euler's 
>graph theory (?) in
>school? ;-)

Yes, I had graph theory at school. But I don�t even remember if it was 
Euler�s. I only remember the Kuratowsky graph K3,3 (I believe that was/is 
it�s name) which is - as far as I remember - the simplest non planar graph 
(one that cannot be embedded into a plain or sphere).

Propably everybody knows the problem, if it is possible to connect three 
houses to the gas-, the water- and electricity providers without crossing 
pipelines/cables.



             )                      /--|--/
            ((                        /|\
            ||                       |---|
        ____||__      ________       |/_\|    <--this is not a rocket
       |        |    | ~~~~~~ |      |\-/|       nor a robot. It simply
       |  gas   |    | ~water~|      /---\       symbolizes electricity.
       |________|    |________|     /  |  \      (OK. Not good)
           | \ \___      |  \ 
           |  \_   \_    |   \_____
           |    \     \________    \  etc.
           |     \___          \    \    __
           .         \   .      \___  . |__|
          / \         \ / \         \/ \|
         /___\         /___\        /___\
         | _ |         |\ /|        | _ |
         ||_||         | x |        || ||
         |___|         |/_\|        ||_||
        
 
Well, that�s enough. You know the problem. But it�s a theory, so I still got 
the chance to prove the opposite ;-).       
        
        
\�\ \�\\�� \\�\ \�\
 \ \_\ \ �\ \\ \_\ \
  \ \ \ \ _\ \\ \ \ \
   \_\ \_\\__/ \_\ \_\