On induced colourful paths in triangle-free graphs

Given a graph G=(V,E) whose vertices have been properly coloured, we say that a path in G is colourful if no two vertices in the path have the same colour. It is a corollary of the Gallai–Roy–Vitaver Theorem that every properly coloured graph contains a colourful path on χ(G) vertices. We explore a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2019-02, Vol.255, p.109-116
Hauptverfasser:	Babu, Jasine, Basavaraju, Manu, Chandran, L. Sunil, Francis, Mathew C.
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Colourful path Graph theory Induced path Triangle-free graph
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!