Please use this identifier to cite or link to this item: https://idr.l4.nitk.ac.in/jspui/handle/123456789/12360
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBabu, J.
dc.contributor.authorBasavaraju, M.
dc.contributor.authorChandran, L.S.
dc.contributor.authorFrancis, M.C.
dc.date.accessioned2020-03-31T08:39:04Z-
dc.date.available2020-03-31T08:39:04Z-
dc.date.issued2019
dc.identifier.citationDiscrete Applied Mathematics, 2019, Vol.255, , pp.109-116en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/12360-
dc.description.abstractGiven 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 conjecture that states that every properly coloured triangle-free graph G contains an induced colourful path on ?(G) vertices and prove its correctness when the girth of G is at least ?(G). Recent work on this conjecture by Gy rf s and S rk zy, and Scott and Seymour has shown the existence of a function f such that if ?(G)?f(k), then an induced colourful path on k vertices is guaranteed to exist in any properly coloured triangle-free graph G. 2018 Elsevier B.V.en_US
dc.titleOn induced colourful paths in triangle-free graphsen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.