TRAVERSING A GRAPH IN GENERAL POSITION

Let G be a graph. Assume that to each vertex of a set of vertices $S\subseteq V(G)$ a robot is assigned. At each stage one robot can move to a neighbouring vertex. Then S is a mobile general position set of G if there exists a sequence of moves of the robots such that all the vertices of G are visit...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Bulletin of the Australian Mathematical Society 2023-12, Vol.108 (3), p.353-365
Hauptverfasser:	KLAVŽAR, SANDI, KRISHNAKUMAR, ADITI, TUITE, JAMES, YERO, ISMAEL G.
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Graph theory Graphs Robots
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!