Characterizations of the simple non-confusing travel groupoids on a finite graph

DOI10.1007/s00373-018-1995-4zbMath1407.05054OpenAlexW2908364976MaRDI QIDQ1733880

Atsuhiko Mizusawa, Diogo Kendy Matsumoto

Publication date: 21 March 2019

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

Full work available at URL: https://doi.org/10.1007/s00373-018-1995-4

zbMATH Keywords

spanning treetravel groupoidsimplenon-confusing

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• Unnamed Item
• A construction of smooth travel groupoids on finite graphs
• T-neighbor systems and travel groupoids on a graph
• 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

This page was built for publication: Characterizations of the simple non-confusing travel groupoids on a finite graph