Abstract
In this paper, some results concerning the colorings of graph powers are presented. The notion of helical graphs is introduced. We show that such graphs are hom-universal with respect to high odd-girth graphs whose ( 2 t + 1 ) th power is bounded by a Kneser graph according to the homomorphism order. Also, we consider the problem of existence of homomorphism to odd cycles. We prove that such homomorphism to a ( 2 k + 1 ) -cycle exists if and only if the chromatic number of the ( 2 k + 1 ) th power of G 1 3 is less than or equal to 3, where G 1 3 is the 3-subdivision of G . We also consider Nešetřil’s Pentagon problem. This problem is about the existence of high girth cubic graphs which are not homomorphic to the cycle of size five. Several problems which are closely related to Nešetřil’s problem are introduced and their relations are presented.
Sign-in/Register to access full text options 
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.
