A Construction of Smooth Travel Groupoids on Finite Graphs

Diogo Kendy Matsumoto*, Atsuhiko Mizusawa

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    2 Citations (Scopus)


    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 Nebeský’s question, “Does there exist a connected graph G such that G has no smooth travel groupoid?”, in finite cases.

    Original languageEnglish
    JournalGraphs and Combinatorics
    Publication statusAccepted/In press - 2015 Sept 30


    • Finite graph
    • Smooth travel groupoid
    • Spanning tree
    • Travel groupoid

    ASJC Scopus subject areas

    • Discrete Mathematics and Combinatorics
    • Theoretical Computer Science


    Dive into the research topics of 'A Construction of Smooth Travel Groupoids on Finite Graphs'. Together they form a unique fingerprint.

    Cite this