A construction of smooth travel groupoids on finite graphs

DOI10.1007/s00373-015-1630-6zbMath1339.05184arXiv1409.3711OpenAlexW1865378467MaRDI QIDQ293646

Atsuhiko Mizusawa, Diogo Kendy Matsumoto

Publication date: 9 June 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1409.3711

zbMATH Keywords

spanning treefinite graphsmooth travel groupoidtravel groupoid

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Related Items

Unnamed Item, T-neighbor systems and travel groupoids on a graph, Characterizations of the simple non-confusing travel groupoids on a finite graph

Cites Work

• The Non-confusing Travel Groupoids on a Finite Connected Graph
• New proof of a characterization of geodetic graphs
• Travel groupoids
• An algebraic characterization of geodetic graphs
• Travel groupoids on infinite graphs
• Unnamed Item