A construction of smooth travel groupoids on finite graphs
arXiv:1409.3711 · doi:10.1007/s00373-015-1630-6
Abstract
A travel groupoid is an algebraic system related with graphs. In this paper, we give an algorithm to construct smooth travel groupoids for any finite graph. This algorithm gives an answer of L.~Nebesk$\acute{\mbox{y}}$'s question, "Does there exists a connected graph such that has no smooth travel groupoid?", in finite cases.
7 pages. We added the journal reference