Abstract
In this paper, we prove that every 3-chromatic connected graph, except C7, admits a 3-vertex coloring in which every vertex is the beginning of a 3-chromatic path with 3 vertices. It is a special case of a conjecture due to S. Akbari, F. Khaghanpoor, and S. Moazzeni stating that every connected graph G other than C7 admits a χ(G)-coloring such that every vertex of G is the beginning of a colorful path (i.e. a path on χ(G) vertices containing a vertex of each color). We also provide some support for the conjecture in the case of 4-chromatic graphs.
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.
