Digraph redicolouring

Given two $k$-dicolourings of a digraph $D$, we prove that it is PSPACE-complete to decide whether we can transform one into the other by recolouring one vertex at each step while maintaining a dicolouring at any step even for $k=2$ and for digraphs with maximum degree $5$ or oriented planar graphs...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bousquet, Nicolas, Havet, Frédéric, Nisse, Nicolas, Picasarri-Arrieta, Lucas, Reinald, Amadeus
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Discrete Mathematics Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!