Abstract
We call the tournament T an m-coloured tournament if the arcs of T are coloured with m colours. In this paper we have proved that if T is an m-coloured tournament which does not contain any tournament of order 3 whose arcs are coloured with three distinct colours then there is a vertex v of T such that for every other vertex x of T there is a monochromatic path from x to v.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
