A 4-node graph equivalent to <a href="https://en.wikipedia.org/wiki/Euler" class="extiw" title="en:Euler">Euler</a>'s problem of the <a href="https://en.wikipedia.org/wiki/Seven_Bridges_of_K%C3%B6nigsberg" class="extiw" title="en:Seven Bridges of Königsberg">Seven Bridges of Königsberg</a>. <i>See:</i> <a href="https://en.wikipedia.org/wiki/Graph_theory#Glossary" class="extiw" title="en:Graph theory">Graph theory#Glossary</a>
<a href="https://en.wikipedia.org/wiki/User:Xiong" class="extiw" title="en:User:Xiong">Xiong</a> (<a href="https://en.wikipedia.org/wiki/User_talk:Xiong" class="extiw" title="en:User talk:Xiong">talk</a>) (<a href="https://en.wikipedia.org/wiki/Special:ListFiles/Xiong" class="extiw" title="en:Special:ListFiles/Xiong">Uploads</a>)
CC BY-SA 3.0
<span class="int-own-work" lang="en">Own work</span>